Daniele Gardy                                                   


My research interests are in analysis of algorithms and its applications, using mathematical tools that come mostly from analytic combinatorics. 

I have a special interest in quantitative logic and in random allocations. Recently, I have also begun to modelize and analyze a constraint solver, in collaboration with Xavier Lorca and Charlotte Truchet from Nantes.


I am the coordinator of the French ANR Blanc BOOLE project (2009-13) //boole.prism.uvsq.fr

Some of the projects in which I have been involved are the French ANR SADA, and bilateral european projects (PHC): Amadeus (2006-07, 2010-11, 2013-14) with the team Combinatorics and Algorithms at the DMG institute of T.U. Wien (Austria); Polonium (2007-08 and 2011-12) with the TCS team at Jagiellonian University in Krakow (Poland).

I have been granted a temporary position at CNRS (délégation) for the academic year 2012-13, and am currently a long-term visitor at the Department of Discrete Mathematics and Geometry (DMG) at TU Wien.


You can find here my list of publications with sources for some papers and talks.

Recent PhD students

Recent collaborators


The 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 algorithms.