The Size of Projections of Relations Satisfying a Functional Dependency. - Erol Gelenbe; Danièle Gardy (VLDB, 1982)

On the Size of Projections: I. - Erol Gelenbe; Danièle Gardy (Inf. Process. Lett., 1982)

Relational Algebra Operations and Sizes of Relations. - Danièle Gardy; Claude Puech (ICALP, 1984)

On the sizes of projections: a generating function approach. - Danièle Gardy; Claude Puech (Inf. Syst., 1984)

Random Allocations and Probabilistic Languages. - Philippe Flajolet; Danièle Gardy; Loÿs Thimonier (ICALP, 1988)

On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. - Danièle Gardy; Philippe Flajolet; Claude Puech (WADS, 1989)

Average cost of orthogonal range queries in multiattribute trees. - Danièle Gardy; Philippe Flajolet; Claude Puech (Inf. Syst., 1989)

On the Effects of Join Operations on Relation Sizes. - Danièle Gardy; Claude Puech (ACM Trans. Database Syst., 1989)

Saddle Point Techniques in Asymptotic Coding Theory. - Danièle Gardy; Patrick Solé (Algebraic Coding, 1991)

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. - Philippe Flajolet; Danièle Gardy; Loÿs Thimonier (Discret. Appl. Math., 1992)

Enumerating Davenport-Schinzel sequences. - Danièle Gardy; Dominique Gouyou-Beauchamps (RAIRO Theor. Informatics Appl., 1992)

Normal Limiting Distributions for Projection and Semijoin Sizes. - Danièle Gardy (SIAM J. Discret. Math., 1992)

Methode de col et lois limites en analyse combinatoire. - Danièle Gardy (Theor. Comput. Sci., 1992)

Join Sizes, urn Models and Normal Limiting Distributions. - Danièle Gardy (Theor. Comput. Sci., 1994)

Dynamic Analysis of the Sizes of Relations. - Danièle Gardy; Guy Louchard (STACS, 1995)

Some results on the asymptotic behaviour of coefficients of large powers of functions. - Danièle Gardy (Discret. Math., 1995)

Dynamic Analysis of some Relational Databases Parameters. - Danièle Gardy; Guy Louchard (Theor. Comput. Sci., 1995)

An urn model from learning theory. - Stéphane Boucheron; Danièle Gardy (Random Struct. Algorithms, 1997)

Formule de Yao et modèles d'urnes. - Danièle Gardy; Laurent Némirovski (BDA, 1998)

Urn Models and Yao's Formula. - Danièle Gardy; Laurent Némirovski (ICDT, 1999)

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract. - Dominique Barth; Sylvie Corteel; Alain Denise; Danièle Gardy; Mario Valencia-Pabon (LATIN, 2000)

A Unified Presentation of Some Urn Models. - Michael Drmota; Danièle Gardy; Bernhard Gittenberger (Algorithmica, 2001)

Generating functions for generating trees. - Cyril Banderier; Mireille Bousquet-Mélou; Alain Denise; Philippe Flajolet; Danièle Gardy; Dominique Gouyou-Beauchamps (Discret. Math., 2002)

The permutation-path coloring problem on trees. - Sylvie Corteel; Mario Valencia-Pabon; Danièle Gardy; Dominique Barth; Alain Denise (Theor. Comput. Sci., 2003)

And/Or Trees Revisited. - Brigitte Chauvin; Philippe Flajolet; Danièle Gardy; Bernhard Gittenberger (Comb. Probab. Comput., 2004)

General urn models with several types of balls and Gaussian limiting fields. - Michael Drmota; Danièle Gardy; Bernhard Gittenberger (Random Struct. Algorithms, 2004)

Classical and Intuitionistic Logic Are Asymptotically Identical. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Marek Zaionc (CSL, 2007)

Complexity and Limiting Ratio of Boolean Functions over Implication. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Bernhard Gittenberger (MFCS, 2008)

Balanced And/Or Trees and Linear Threshold Functions. - Hervé Fournier; Danièle Gardy; Antoine Genitrini (ANALCO, 2009)

Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models - Danièle Gardy; Yann Ponty (CoRR, 2010)

Tautologies over implication with negative literals. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Marek Zaionc (Math. Log. Q., 2010)

Lambda-terms of Bounded Unary Height. - Olivier Bodini; Danièle Gardy; Bernhard Gittenberger (ANALCO, 2011)

The Growing Trees Distribution on Boolean Functions. - Brigitte Chauvin; Danièle Gardy; Cécile Mailler (ANALCO, 2011)

The weighted words collector - Jérémie Du Boisberranger; Danièle Gardy; Yann Ponty (CoRR, 2012)

Boys-and-girls Birthdays and Hadamard Products. - Olivier Bodini; Danièle Gardy; Olivier Roussel (Fundam. Informaticae, 2012)

The fraction of large random trees representing a given Boolean function in implicational logic. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Bernhard Gittenberger (Random Struct. Algorithms, 2012)

When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent. - Jérémie Du Boisberranger; Danièle Gardy; Xavier Lorca; Charlotte Truchet (ANALCO, 2013)

Enumeration of Generalized BCI Lambda-terms. - Olivier Bodini; Danièle Gardy; Bernhard Gittenberger; Alice Jacquot (Electron. J. Comb., 2013)

Asymptotics and random sampling for BCI and BCK lambda terms. - Olivier Bodini; Danièle Gardy; Alice Jacquot (Theor. Comput. Sci., 2013)

Probabilities of 2-Xor Functions. - Elie de Panafieu; Danièle Gardy; Bernhard Gittenberger; Markus Kuba (LATIN, 2014)

A sprouting tree model for random boolean functions. - Brigitte Chauvin; Danièle Gardy; Cécile Mailler (Random Struct. Algorithms, 2015)

2-Xor Revisited: Satisfiability and Probabilities of Functions. - Elie de Panafieu; Danièle Gardy; Bernhard Gittenberger; Markus Kuba (Algorithmica, 2016)

Threshold functions for small subgraphs: an analytic approach. - Gwendal Collet; Elie de Panafieu; Danièle Gardy; Bernhard Gittenberger; Vlady Ravelomanana (Electron. Notes Discret. Math., 2017)

Threshold functions for small subgraphs in simple graphs and multigraphs. - Gwendal Collet; Élie de Panafieu; Danièle Gardy; Bernhard Gittenberger; Vlady Ravelomanana (Eur. J. Comb., 2020)

A computational model for logical analysis of data. - Danièle Gardy; Frédéric Lardeux; Frédéric Saubion (Int. J. Data Sci. Anal., 2025)