• H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger:  ``Complexity and limiting ratio of boolean functions over implication''. International Conference on Mathematical Foundations of Computer Science (MFCS). Torun, Pologne, Aug. 2008.
• H. Fournier, D. Gardy, A. Genitrini, M. Zaionc:  ``Classical and intuitionistic logic are asymptotically identical''. 16th EACSL Annual Conference on Computer Science and Logic, Lausanne, September 2007. [Postscript file]
• D. Gardy : ``Random Boolean expressions.'' Colloquium "Computational Logic and Applications", Chambéry, June 2005;  DMTCS Proceedings AF, 2006 .  [  pdf  file]
• D. Gardy, A. Woods : ``And/Or tree probabilities of Boolean functions.'' First Colloquium on the Analysis of Algorithms, Barcelona, June 2005. DMTCS Proceedings AD, 2005 [  postscript  or  pdf  file]
• D. Gardy : Expressions Booléennes Aléatoires,  CIRM (Marseille), Aléa'05 (in french). [ postscript  or  pdf  file]
• B. Chauvin, P. Flajolet, D. Gardy and B. Gittenberger : `` And/Or trees revisited.'' Combinatorics, Probability and Computing, Vol. 13 No. 4-5, 2004   [ postscript   file]
• M. Drmota, D. Gardy and B. Gittenberger : ``General urn models with several types of balls and Gaussian limiting fields.'' PRiSM Research Report No. 2001/8, May 2001. [ postscript  file]
• D. Barth, S. Corteel, A. Denise, D. Gardy, M. Valencia-Pabon : ``The permutation-path coloring problem on trees .''  Theoretical Computer Science, special issue on the Fourth Latin America Theoretical INformatics International  Conference (LATIN'2000) [ postscript  file]
• C. Banderier, M. Bousquet-Melou, A. Denise, P. Flajolet, D. Gardy, D. Gouyou-Beauchamps :  ``On generating functions for generation trees.''  Discrete Mathematics,  special issue on the Conference FPSAC'99  [ postscript  file]
• M. Drmota, D. Gardy and B. Gittenberger : ``A unified presentation of some urn models.'' Algorithmica, special issue on the analysis of algorithms, April 1999. [ postscript  file]
• D. Gardy :  ``Occupancy urn models in the analysis of algorithms.''  Journal of Statistical Planning and Inference, 1999, special issue on the fourth International Conference on Lattice path Combinatorics and Applications, Wien (Austria), July 1998. [ postscript  file ]
• D. Gardy and L. Nemirovski :  ``Urn models and Yao's formula.''  Seventh International Conference on Database Theory,  Jerusalem (Israel), January 1999. [  postscript  file]
• S. Boucheron and D. Gardy :  ``An urn model from learning theory.'' Random Structures and Algorithms,  special issue on the analysis of algorithms, Vol. 10, January 1997. [  postscript  file ]
• Ph. Flajolet, D. Gardy and L. Thimonier : `` Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.'' Discrete Applied Mathematics, Vol. 39, 1992. [Postscript]