Daniele Gardy                                                   


I am a member of the David lab at the university of Versailles-Saint Quentin.
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 databases (I recently went back to it, for an analysis of B-trees) and on random allocations. I then developed a special interest in quantitative logic, 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 constraint solvers is quite natural. Another tool that comes handy when modelling satisfiability problems is graphs, 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 ANR Blanc Boole project (2009-13), of which I was the coordinator, and bilateral european projects (PHC): several Amadeus projects with the team Combinatorics and Algorithms at the DMG institute of T.U. Wien (Austria); and two Polonium projects (2007-08 and 2011-12) with the TCS team at Jagiellonian University in Krakow (Poland).
I am currently a member of the bilateral ANR project Metaconc headed by Olivier Bodini (France) and Hsien-Kuei Hwang (Taiwan), and of the PICS project ACCA, headed by Vlady Ravelomanana.

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 (LMV, Versailles) and Julien Clement (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 publications with sources for some papers and talks, and there my publications according to DBLP.

Former PhD students

Recent and current collaborators


The Analysis of Algorithms (AofA) page
The French GDR IM  
The French Alea group 
The Alea in Europe network


I am a professor of Computer Science at the Computer Science department (http://info.iut-velizy.uvsq.fr/) of the IUT of Velizy (http://www.iut-velizy.uvsq.fr/), which is part of the University of Versailles Saint-Quentin. I teach mostly programming and algorithms.


David Lab, UFR of Sciences, University of Versailles-Saint Quentin. 45 avenue des Etats-Unis, 78035 Versailles (cedex). France

mail : prenom_dot_nom_at_uvsq_dot_fr