Danièle Gardy

According to our database1, Danièle Gardy authored at least 44 papers between 1982 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Threshold functions for small subgraphs in simple graphs and multigraphs.
Eur. J. Comb., 2020

2017
Threshold functions for small subgraphs: an analytic approach.
Electron. Notes Discret. Math., 2017

2016
2-Xor Revisited: Satisfiability and Probabilities of Functions.
Algorithmica, 2016

2015
A sprouting tree model for random boolean functions.
Random Struct. Algorithms, 2015

2014
Probabilities of 2-Xor Functions.
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.
Theor. Comput. Sci., 2013

Enumeration of Generalized BCI Lambda-terms.
Electron. J. Comb., 2013

When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent.
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.
Random Struct. Algorithms, 2012

Boys-and-girls Birthdays and Hadamard Products.
Fundam. Informaticae, 2012

The weighted words collector
CoRR, 2012

2011
The Growing Trees Distribution on Boolean Functions.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

Lambda-terms of Bounded Unary Height.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010
Tautologies over implication with negative literals.
Math. Log. Q., 2010

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

2009
Balanced And/Or Trees and Linear Threshold Functions.
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008
Complexity and Limiting Ratio of Boolean Functions over Implication.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
Classical and Intuitionistic Logic Are Asymptotically Identical.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2004
General urn models with several types of balls and Gaussian limiting fields.
Random Struct. Algorithms, 2004

And/Or Trees Revisited.
Comb. Probab. Comput., 2004

2003
The permutation-path coloring problem on trees.
Theor. Comput. Sci., 2003

2002
Generating functions for generating trees.
Discret. Math., 2002

2001
A Unified Presentation of Some Urn Models.
Algorithmica, 2001

2000
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
Urn Models and Yao's Formula.
Proceedings of the Database Theory, 1999

1998
Formule de Yao et modèles d'urnes.
Proceedings of the 14ème Journées Bases de Données Avancées, 1998

1997
An urn model from learning theory.
Random Struct. Algorithms, 1997

1995
Dynamic Analysis of some Relational Databases Parameters.
Theor. Comput. Sci., 1995

Some results on the asymptotic behaviour of coefficients of large powers of functions.
Discret. Math., 1995

Dynamic Analysis of the Sizes of Relations.
Proceedings of the STACS 95, 1995

1994
Join Sizes, urn Models and Normal Limiting Distributions.
Theor. Comput. Sci., 1994

1992
Methode de col et lois limites en analyse combinatoire.
Theor. Comput. Sci., 1992

Normal Limiting Distributions for Projection and Semijoin Sizes.
SIAM J. Discret. Math., 1992

Enumerating Davenport-Schinzel sequences.
RAIRO Theor. Informatics Appl., 1992

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search.
Discret. Appl. Math., 1992

1991
Saddle Point Techniques in Asymptotic Coding Theory.
Proceedings of the Algebraic Coding, 1991

1989
On the Effects of Join Operations on Relation Sizes.
ACM Trans. Database Syst., 1989

Average cost of orthogonal range queries in multiattribute trees.
Inf. Syst., 1989

On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees.
Proceedings of the Algorithms and Data Structures, 1989

1988
Random Allocations and Probabilistic Languages.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1984
On the sizes of projections: a generating function approach.
Inf. Syst., 1984

Relational Algebra Operations and Sizes of Relations.
Proceedings of the Automata, 1984

1982
On the Size of Projections: I.
Inf. Process. Lett., 1982

The Size of Projections of Relations Satisfying a Functional Dependency.
Proceedings of the Eigth International Conference on Very Large Data Bases, 1982


  Loading...