Book

B. Chauvin, J. Clément and D. Gardy. Arbres pour l'algorithmique. 489 pages (in French), Springer 2019. A preliminary version is available on Hal.

Quantitative logic

O. Bodini, D. Gardy, B. Gittenberger and Z. Gołębiewski. On the number of unary-binary tree-like structures with restrictions on the unary height. Annals of Combinatorics 22, pp. 45--91, 2018.
É. de Panafieu, D. Gardy, B. Gittenberger and M. Kuba. 2-XOR revisited: satisfiability and probabilities of functions. Algorithmica, Vol. 76 (4), pp. 1035--1076. 2016. doi:10.1007/s00453-016-0119-x
É. de Panafieu, D. Gardy, B. Gittenberger and M. Kuba. Probabilities of 2-XOR functions. LATIN 14, Lecture Notes in Computer Science (LNCS), 8392:454-465, Springer, Berlin, 2014.
O. Bodini, D. Gardy, B. Gittenberger and A. Jacquot. Enumeration of generalized BCi lambda-terms. Electronic Journal of Combinatorics, 20, article P30, 23pp. (electronic), 2013.
O. Bodini, D. Gardy and A. Jacquot. Asymptotics and random sampling for BCI and BCK lambda terms. TCS, 2013, doi: 10.1016/j.tcs.2013.01.008
D. Gardy. Arbres pour la logique. Ecole d'automne ADAMA, Madhia (Tunisie), 17-21 Octobre 2012.
O. Bodini, D. Gardy and B. Gittenberger. Lambda-terms of bounded unary height. Siam workshop on Analytic Algorithmics and Combinatorics (ANALCO), January 2011, San Francisco (USA).
O. Bodini, D, Gardy and A. Jacquot. Asymptotics and random sampling for formulae in intuitionnistic logical systems. 7th GASCOM (Génération Aléatoire de Structures COMbinatoires), September 2010, Montréal (Canada)
H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. The fraction of large random trees representing a given Boolean function in implicational logic. Random Structures and Algorithms 40(3), May 2012, 317–349.
B. Chauvin, D. Gardy and C. Mailler. The growing tree distribution on Boolean functions. Siam workshop on Analytic Algorithmics and Combinatorics (ANALCO), January 2011, San Francisco (USA).
H. Fournier, D. Gardy, A. Genitrini and M. Zaionc. Tautologies over implication with negative literals. Math. Log. Quart. 56 (3), 2010.
H. Fournier, D. Gardy and A. Genitrini. Balanced And/Or trees and linear threshold functions. Siam workshop on Analytic Algorithmics and Combinatorics (ANALCO), January 2009, New York (USA).
H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. Complexity and limiting ratio of boolean functions over implication. MFCS'08, Torun (Pologne), Août 2008.
D. Gardy. Expressions booléennes aléatoires; application à la probabilité et complexité de fonctions booléennes. Exposé invité, journées du GDR IM, Paris, 24-25 Janvier 2008.
H. Fournier, D. Gardy, A. Genitrini and M. Zaionc. Classical and intuitionnistic logics are asymptotically identical. Computer Science Logic'07, proceedings in LNCS 4646, pp. 177-193, 2007.
D. Gardy. Random Boolean expressions. Invited paper, Colloquium on Computational Logic and Applications, Chambéry, Juin 2005. DMTCS Proceedings AF, pp. 1-36 R. David, D. Gardy, P. Lescanne, M. Zaionc (eds).
D. Gardy and A. Woods. Lower bounds on probabilities for Boolean functions. First Intern. Conf. on the Analysis of Algorithms, Barcelona, Spain, June 2005. DMTCS Proceedings, vol. AD(2005), pp. 139-146, C. Martinez (ed.).
B. Chauvin, P. Flajolet, D. Gardy and B. Gittenberger. And/Or trees revisited. Combinatorics, Probability and Computing, Vol. 13 No. 4-5, (2004) 475-487.

Graphs

D. Gardy. Compter les sous-graphes. Talk at Metaconc meeting, Caen (January 2019).
E. de Panafieu, G. Collet, D. Gardy, B. Gittenberger and V. Ravelomanana. Threshold functions for small subgraphs in simple graphs and multigraphs. To appear in European J. of Combinatorics.
E. de Panafieu, G. Collet, D. Gardy, B. Gittenberger and V. Ravelomanana. Threshold functions for small subgraphs: an analytic approach. Eurocomb'17, August 2017, Wien (Austria). ArXiV (version extended to include proofs of the results).

Random allocations

J. du Boisberranger, D. Gardy and Y. Ponty. The weighted word collector. Colloque international AofA’12 (Montréal, Juin 2012).
O. Bodini, D. Gardy and O. Roussel. Boys and Girls Birthdays and Hadamard products. Fundamenta Informaticae, Vol. 117, pp. 85-101, 2012.
D. Gardy and Y. Ponty. Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models. 7th conference GASCOM (Génération Aléatoire de Structures COMbinatoires), Montréal (Canada), Septembre 2010.
M. Drmota, D. Gardy and B. Gittenberger. General urn models with several types of balls and Gaussian limiting fields. Random Structures and Algorithms, Vol.24 No.1, 2004.
D. Gardy. Occupancy urn models in analysis of algorithms. J. of Statistical Planning and Inference, special issue on the Fourth International Conference on Lattice Paths Combinatorics and Applications, Vol. 101 (1-2), pp. 95-105, Feb. 2002.
M. Drmota, D. Gardy and B. Gittenberger. A unified presentation of some urn models. Algorithmica, Special issue on the average-case analysis of algorithms, Vol. 29 No 1/2, pp. 120-147, 2001.
S. Boucheron and D. Gardy. An urn model from learning theory. Random Structures and Algorithms, Vol.10 (1-2), pp. 43-67, 1997.
P. Flajolet, D. Gardy and L. Thimonier. Birthday paradox, coupon collector, caching algorithms and self-organizing search. Discrete Applied Mathematics, Vol. 39, pp. 207-229, 1992

Constraint solvers

J. du Boisberranger, D. Gardy, X. Lorca and C. Truchet. When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent. International Workshop ANALCO 13, New Orleans (USA), January 6, 2013.
D. Gardy, F. Lardeux, F. Saubion. A Computational Model for Logiacl Analysis of Data. ArXiV Report 2207.05664, July 2022 http://arxiv.org/abs/2207.05664

Analysis of some database parameters

B. Chauvin, D. Gardy, N. Pouyanne and D.-H. Ton That. B-urns. ALEA, Lat. Am. J. Probab. Math. Stat. 13, 2016.
D. Gardy and L. Nemirovski. Urn models and Yao's formula. Seventh International Conference on Database Theory, Jerusalem (Israel), January 10-12, 1999. Lecture Notes in Computer Science No. 1540, Springer-Verlag, C. Beeri and P. Buneman (eds), pp. 100-112.
D. Gardy and G. Louchard. Dynamic analysis of some relational data bases parameter. Theoretical Computer Science, special issue on the analysis of algorithms, Vol. 144, Nos 1-2, June 1995, pp. 125-159.
D. Gardy and G. Louchard. Dynamic analysis of the sizes of relations. Symposium on Theoretical Aspects of Computer Science, March 1995, Munich. Lecture Notes in Computer Science, Springer Verlag, Vol. 900, pp. 433-444.
D. Gardy. Join sizes, urn models and normal limiting distributions. Theoretical Computer Science(A), Vol. 131, August 1994, pp. 375-414.
D. Gardy. Normal limiting distributions for projection and semijoin sizes. Siam Journal on Discrete Mathematics, Vol. 5 No. 2, May 1992, pp. 219-248.
D. Gardy, Ph. Flajolet and C. Puech. Average cost of orthogonal range queries on multiattribute trees. Information Systems, Vol. 14 No. 4, 1989, pp. 341-350.
D. Gardy and C. Puech. On the effect of join operations on relation sizes. ACM Transactions On Database Systems, Vol. 14 No. 4, December 1989, pp. 574-603.
D. Gardy, Ph. Flajolet and C. Puech. On the performance of orthogonal range queries in multi-attribute trees. Workshop on Algorithms and Data Structures, Ottawa (Canada), August 1989. Lecture Notes in Computer Science, Springer-Verlag, Vol. 382, pp. 218-229.
D. Gardy and C. Puech. Relational algebra operations and sizes of relations. Eleventh International Conference on Automata, Languages and Programming, July 1984, Antwerp (Belgium). Lecture Notes in Computer Science, Springer-Verlag, Vol. 172, pp. 174-186.
D. Gardy and C. Puech. On the sizes of projections: a generating function approach. Information Systems, Vol. 9 No. 3/4, 1984, pp. 231-235.
E. Gelenbe and D. Gardy. On the size of projections: Part II. Eight International Conference on Very Large Data Bases, Mexico (Mexique), September 1982.
E. Gelenbe and D. Gardy On the size of projections: Part I. Information Processing Letters, Vol. 14 No. 1, March 1982.

Proceedings

M. Drmota, P. Flajolet, D. Gardy, B. Gittenberger, editors. Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities. Birkhauser, 2004. Proceedings of the Third Colloquium on Mathematics and Computer Science, September 13-17, 2004, Technical University of Wien (Austria).
B. Chauvin, P. Flajolet, D. Gardy, A. Mokkadem, editors. Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities. Birkhauser, 2002. Proceedings of the Second Colloquium on Mathematics and Computer Science, September 16-19, 2002, University of Versailles St-Quentin (France).
D. Gardy, A. Mokkadem, editors. Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities. Birkhauser, 2000. Proceedings of the First Colloquium on Mathematics and Computer Science, September 2000, University of Versailles St-Quentin (France).

Miscellaneous

D. Barth, S. Corteel, A. Denise, D. Gardy and 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), Vol. 297 No. 1-3, pp 119-143, March 2003.
C. Banderier, M. Bousquet-Melou, A. Denise, P. Flajolet, D. Gardy and D. Gouyou-Beauchamps. On generating functions for generation trees. Discrete Mathematics, special issue on the Eleventh Conference on Formal Power Series and Algebraic Combinatorics, Vol. 246, pp. 29-52, February 2002.
D. Gardy. Enumeration of bicolored objects according to their color balance. Eleventh Conference on Formal Power Series and Algebraic Combinatorics, Barcelona (Spain), June 1999.
D. Gardy. Some results on the asymptotic behaviour of coefficients of large powers of functions. Discrete Mathematics, Vol. 139, 1995, pp. 189-217.
D. Gardy. Méthode de col et lois limites en analyse combinatoire. Theoretical Computer Science(A), Vol. 94 No. 2, pp. 261-280, March 1992.
D. Gardy and D. Gouyou-Beauchamps. Enumerating Davenport-Schinzel sequences. RAIRO Theoretical Computer Science and Applications, Vol. 26 No. 5, 1992, pp. 387-402.
D. Gardy and P. Sole. Saddle-point techniques in asymptotic coding theory. Rencontre France-URSS de Codage, Paris, July 1991. Lecture Notes in Computer Science, Springer Verlag, No. 573, p. 75-81.