**D. Gardy**

Random Boolean expressions.

Colloquium on Computational Logic and Applications, Chambery (France),
June 2005. Proceedings in DMTCS, 2006.

**D. Gardy, A Woods**

And/Or tree probabilities of Boolean functions.

First Colloquium on the Analysis of Algorithms, Barcelona,
June 2005.

**D. Gardy**

Expressions Booléennes aléatoires.

Invited course for the Journées Aléa'05, CIRM, Marseille,
March 2005.

**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 and B. Gittenberger**

And/Or trees revisited.

Combinatorics, Probability and Computing, Vol. 13 No.
4-5, pp. 475-497, 2004.

**M. Drmota, D. Gardy and B. Gittenberger**

General urn models with several types of balls and Gaussian
limiting fields.

Random Structures and Applications, Vol. 24 No. 1, 2004.

**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),

Vol. 297 No. 1-3, pp 119-143, March 2003.

**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**

Occupancy urn models in analysis of algorithms.
*Journal 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, February 2002.

**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.

**M. Drmota, D. Gardy and B. Gittenberger**

A unified presentation of some urn models.
*Algorithmica, *special issue on the analysis of
algorithms, Vol. 29, No. 1/2, pp. 120-147, Jan.-Feb. 2001.

**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).

**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 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.

**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, pp. 43-67.

**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**

Some results on the asymptotic behaviour of coefficients
of large powers of functions.
*Discrete Mathematics, *Vol. 139, 1995, pp. 189-217.

**D. Gardy**

Join sizes, urn models and normal limiting distributions.
*Theoretical Computer Science(A), *Vol. 131, August
1994, pp. 375-414.

**D. Gardy**

The asymptotic behaviour of coefficients of large powers
of functions.
*Fourth Conference on Formal Power Series and Algebraic
Combinatorics,
*Montreal (Canada), June 1992.

Proceedings edited by P. Leroux and C. Reutenauer, publications
du LACIM (UQAM), no. 11, pp. 237-248.

**D. Gardy**

Methode 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**

Normal limiting distributions for projection and semijoin
sizes.
*Siam Journal on Discrete Mathematics, *Vol. 5 No.
2, May 1992, pp. 219-248.

**Ph. Flajolet, D. Gardy and L. Thimonier**

Birthday Paradox, Coupon Collectors, Caching Algorithms
and Self-Organizing Search.
*Discrete Applied Mathematics, *Vol. 39, 1992, pp.
207-229.

**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.

**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.

**Ph. Flajolet, D. Gardy and L. Thimonier**

Random allocations and probabilistic languages.
*Fifteenth International Conference on Automata, Languages
and Programming,
*July 1988, Tampere (Finland).

Lecture Notes in Computer Science, Springer-Verlag, Vol.
317, pp. 239-253.

**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. 184-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.