Danièle Gardy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Danièle Gardy has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Bernhard Gittenberger
Technische Universität Wien
10 shared publications Antoine Genitrini
3 shared publicationsHervé Fournier
3 shared publicationsPhilippe Flajolet
3 shared publicationsÉlie de Panafieu
3 shared publicationsAlain Denise
2 shared publications
Latest Publications
- 13 December 2023
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 20 (1) , 47-74
A computational model for logical analysis of data
- 13 December 2023
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 20 (1) , 47-74
A computational model for logical analysis of data
- Open Access
- 13 February 2018
- Published by Springer Nature in Annals of Combinatorics
- Vol. 22 (1) , 45-91
On the Number of Unary-Binary Tree-Like Structures with Restrictions on the Unary Height
- 13 February 2018
- Published by Springer Nature in Annals of Combinatorics
- Vol. 22 (1) , 45-91
Open AccessOn the Number of Unary-Binary Tree-Like Structures with Restrictions on the Unary Height
- 1 August 2017
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 61, 271-277
Threshold functions for small subgraphs: an analytic approach
- 1 August 2017
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 61, 271-277
Threshold functions for small subgraphs: an analytic approach
- 11 February 2016
- Published by Springer Nature in Algorithmica
- Vol. 76 (4) , 1035-1076
2-Xor Revisited: Satisfiability and Probabilities of Functions
- 11 February 2016
- Published by Springer Nature in Algorithmica
- Vol. 76 (4) , 1035-1076
2-Xor Revisited: Satisfiability and Probabilities of Functions
- 1 January 2016
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 13 (1) , 605
B-urns
- 1 January 2016
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 13 (1) , 605
B-urns
- 31 July 2014
- Published by Wiley in Random Structures & Algorithms
- Vol. 47 (4) , 635-662
A sprouting tree model for random boolean functions
- 31 July 2014
- Published by Wiley in Random Structures & Algorithms
- Vol. 47 (4) , 635-662
A sprouting tree model for random boolean functions
- Open Access
- 14 October 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P30
Enumeration of Generalized $BCI$ Lambda-termsWe investigate the asymptotic number of elements of size $n$ in a particular class of closed lambda-terms (so-called $BCI(p)$-terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the generating function of the counting sequence we obtain a recurrence relation which can be solved asymptotically. We derive differential equations for the generating functions of the counting sequences of other more general classes of terms as well: the class of $BCK(p)$-terms and that of closed lambda-terms. Using elementary arguments we obtain upper and lower estimates for the number of closed lambda-terms of size $n$. Moreover, a recurrence relation is derived which allows an efficient computation of the counting sequence. $BCK(p)$-terms are discussed briefly.- 14 October 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P30
Open AccessEnumeration of Generalized $BCI$ Lambda-termsWe investigate the asymptotic number of elements of size $n$ in a particular class of closed lambda-terms (so-called $BCI(p)$-terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the generating function of the counting sequence we obtain a recurrence relation which can be solved asymptotically. We derive differential equations for the generating functions of the counting sequences of other more general classes of terms as well: the class of $BCK(p)$-terms and that of closed lambda-terms. Using elementary arguments we obtain upper and lower estimates for the number of closed lambda-terms of size $n$. Moreover, a recurrence relation is derived which allows an efficient computation of the counting sequence. $BCK(p)$-terms are discussed briefly. - 1 January 2012
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 117 (1-4) , 85-101
Boys-and-girls Birthdays and Hadamard Products
Boltzmann models from statistical physics, combined with methods from analytic combinatorics, give rise to efficient and easy-to-write algorithms for the random generation of combinatorial objects. This paper proposes to extend Boltzmann generators t
- 1 January 2012
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 117 (1-4) , 85-101
Boys-and-girls Birthdays and Hadamard Products
Boltzmann models from statistical physics, combined with methods from analytic combinatorics, give rise to efficient and easy-to-write algorithms for the random generation of combinatorial objects. This paper proposes to extend Boltzmann generators t