My research interests are in analysis of algorithms and its applications, using mathematical tools that come mostly from analytic combinatorics.
My early research was on analyzing parameters of
(I recently went back to it, for an analysis of
B-trees) and on random
I then developed a special interest in quantitative
, where we look at random logical formulae from a
statistical point of view. This naturally involves satisfiability
problems; from there the transition to analyzing the performance of
is quite natural.
Another tool that comes handy when modelling satisfiability problems
, and I have begun to investigate
problems related to the occurrence of patterns.
Some of the projects in which I have been involved are the French
of which I was the coordinator, and bilateral european projects
(PHC): several Amadeus projects with the team Combinatorics and
at the DMG
institute of T.U. Wien
(Austria); and two Polonium projects (2007-08 and 2011-12) with
team at Jagiellonian University in
I am currently a member of the bilateral ANR project Metaconc
(France) and Hsien-Kuei
(Taiwan), and of the PICS project ACCA, headed by Vlady
During the academic year 2012-13, I was on a temporary position at
CNRS (délégation), which I spent as a long-term visitor at the
Department of Discrete Mathematics and Geometry (DMG) at TU Wien.
In the course of a long-term collaboration with Brigitte Chauvin
Versailles) and Julien
(GREYC, Caen), we have written a book (in French) on tree structures that occur in the analysis of
algorithms, together with their analysis -- using both analytic
combinatorics and probability tools. Hopefully the book will appear
sometime in the future.
You can find here my list of
with sources for some papers and talks, and
my (somewhat incomplete) list of publications according to DBLP.