Danièle Gardy

According to our database, Danièle Gardy authored at least 45 papers between 1982 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

A Computational Model for Logical Analysis of Data.

Danièle Gardy, Frédéric Lardeux, Frédéric Saubion

CoRR, 2022

2020

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

2017

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

2016

2-Xor Revisited: Satisfiability and Probabilities of Functions.

Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba

Algorithmica, 2016

2015

A sprouting tree model for random boolean functions.

Brigitte Chauvin, Danièle Gardy, Cécile Mailler

Random Struct. Algorithms, 2015

2014

Probabilities of 2-Xor Functions.

Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Asymptotics and random sampling for BCI and BCK lambda terms.

Olivier Bodini, Danièle Gardy, Alice Jacquot

Theor. Comput. Sci., 2013

Enumeration of Generalized BCI Lambda-terms.

Olivier Bodini, Danièle Gardy, Bernhard Gittenberger, Alice Jacquot

Electron. J. Comb., 2013

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

Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

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

Boys-and-girls Birthdays and Hadamard Products.

Olivier Bodini, Danièle Gardy, Olivier Roussel

Fundam. Informaticae, 2012

The weighted words collector

Jérémie Du Boisberranger, Danièle Gardy, Yann Ponty

CoRR, 2012

2011

The Growing Trees Distribution on Boolean Functions.

Brigitte Chauvin, Danièle Gardy, Cécile Mailler

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

Lambda-terms of Bounded Unary Height.

Olivier Bodini, Danièle Gardy, Bernhard Gittenberger

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010

Tautologies over implication with negative literals.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc

Math. Log. Q., 2010

Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models

Danièle Gardy, Yann Ponty

CoRR, 2010

2009

Balanced And/Or Trees and Linear Threshold Functions.

Hervé Fournier, Danièle Gardy, Antoine Genitrini

Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008

Complexity and Limiting Ratio of Boolean Functions over Implication.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Classical and Intuitionistic Logic Are Asymptotically Identical.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2004

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

Michael Drmota, Danièle Gardy, Bernhard Gittenberger

Random Struct. Algorithms, 2004

And/Or Trees Revisited.

Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger

Comb. Probab. Comput., 2004

2003

The permutation-path coloring problem on trees.

Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise

Theor. Comput. Sci., 2003

2002

Generating functions for generating trees.

Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps

Discret. Math., 2002

2001

A Unified Presentation of Some Urn Models.

Michael Drmota, Danièle Gardy, Bernhard Gittenberger

Algorithmica, 2001

2000

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

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Urn Models and Yao's Formula.

Danièle Gardy, Laurent Némirovski

Proceedings of the Database Theory, 1999

1998

Formule de Yao et modèles d'urnes.

Danièle Gardy, Laurent Némirovski

Proceedings of the 14ème Journées Bases de Données Avancées, 1998

1997

An urn model from learning theory.

Stéphane Boucheron, Danièle Gardy

Random Struct. Algorithms, 1997

1995

Dynamic Analysis of some Relational Databases Parameters.

Danièle Gardy, Guy Louchard

Theor. Comput. Sci., 1995

Some results on the asymptotic behaviour of coefficients of large powers of functions.

Danièle Gardy

Discret. Math., 1995

Dynamic Analysis of the Sizes of Relations.

Danièle Gardy, Guy Louchard

Proceedings of the STACS 95, 1995

1994

Join Sizes, urn Models and Normal Limiting Distributions.

Danièle Gardy

Theor. Comput. Sci., 1994

1992

Methode de col et lois limites en analyse combinatoire.

Danièle Gardy

Theor. Comput. Sci., 1992

Normal Limiting Distributions for Projection and Semijoin Sizes.

Danièle Gardy

SIAM J. Discret. Math., 1992

Enumerating Davenport-Schinzel sequences.

Danièle Gardy, Dominique Gouyou-Beauchamps

RAIRO Theor. Informatics Appl., 1992

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.

Philippe Flajolet, Danièle Gardy, Loÿs Thimonier

Discret. Appl. Math., 1992

1991

Saddle Point Techniques in Asymptotic Coding Theory.

Danièle Gardy, Patrick Solé

Proceedings of the Algebraic Coding, 1991

1989

On the Effects of Join Operations on Relation Sizes.

Danièle Gardy, Claude Puech

ACM Trans. Database Syst., 1989

Average cost of orthogonal range queries in multiattribute trees.

Danièle Gardy, Philippe Flajolet, Claude Puech

Inf. Syst., 1989

On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees.

Danièle Gardy, Philippe Flajolet, Claude Puech

Proceedings of the Algorithms and Data Structures, 1989

1988

Random Allocations and Probabilistic Languages.

Philippe Flajolet, Danièle Gardy, Loÿs Thimonier

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1984

On the sizes of projections: a generating function approach.

Danièle Gardy, Claude Puech

Inf. Syst., 1984

Relational Algebra Operations and Sizes of Relations.

Danièle Gardy, Claude Puech

Proceedings of the Automata, 1984

1982

On the Size of Projections: I.

Erol Gelenbe, Danièle Gardy

Inf. Process. Lett., 1982

The Size of Projections of Relations Satisfying a Functional Dependency.

Erol Gelenbe, Danièle Gardy

Proceedings of the Eigth International Conference on Very Large Data Bases, 1982