default search action
Danièle Gardy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i4]Danièle Gardy, Frédéric Lardeux, Frédéric Saubion:
A Computational Model for Logical Analysis of Data. CoRR abs/2207.05664 (2022) - 2020
- [j26]Gwendal Collet, Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana:
Threshold functions for small subgraphs in simple graphs and multigraphs. Eur. J. Comb. 88: 103113 (2020)
2010 – 2019
- 2017
- [j25]Gwendal Collet, Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana:
Threshold functions for small subgraphs: an analytic approach. Electron. Notes Discret. Math. 61: 271-277 (2017) - 2016
- [j24]Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba:
2-Xor Revisited: Satisfiability and Probabilities of Functions. Algorithmica 76(4): 1035-1076 (2016) - 2015
- [j23]Brigitte Chauvin, Danièle Gardy, Cécile Mailler:
A sprouting tree model for random boolean functions. Random Struct. Algorithms 47(4): 635-662 (2015) - 2014
- [c16]Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba:
Probabilities of 2-Xor Functions. LATIN 2014: 454-465 - 2013
- [j22]Olivier Bodini, Danièle Gardy, Bernhard Gittenberger, Alice Jacquot:
Enumeration of Generalized BCI Lambda-terms. Electron. J. Comb. 20(4): 30 (2013) - [j21]Olivier Bodini, Danièle Gardy, Alice Jacquot:
Asymptotics and random sampling for BCI and BCK lambda terms. Theor. Comput. Sci. 502: 227-238 (2013) - [c15]Jérémie Du Boisberranger, Danièle Gardy, Xavier Lorca, Charlotte Truchet:
When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent. ANALCO 2013: 80-90 - 2012
- [j20]Olivier Bodini, Danièle Gardy, Olivier Roussel:
Boys-and-girls Birthdays and Hadamard Products. Fundam. Informaticae 117(1-4): 85-101 (2012) - [j19]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
The fraction of large random trees representing a given Boolean function in implicational logic. Random Struct. Algorithms 40(3): 317-349 (2012) - [i3]Jérémie Du Boisberranger, Danièle Gardy, Yann Ponty:
The weighted words collector. CoRR abs/1202.0920 (2012) - 2011
- [c14]Olivier Bodini, Danièle Gardy, Bernhard Gittenberger:
Lambda-terms of Bounded Unary Height. ANALCO 2011: 23-32 - [c13]Brigitte Chauvin, Danièle Gardy, Cécile Mailler:
The Growing Trees Distribution on Boolean Functions. ANALCO 2011: 45-56 - 2010
- [j18]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc:
Tautologies over implication with negative literals. Math. Log. Q. 56(4): 388-396 (2010) - [i2]Danièle Gardy, Yann Ponty:
Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models. CoRR abs/1012.1129 (2010)
2000 – 2009
- 2009
- [c12]Hervé Fournier, Danièle Gardy, Antoine Genitrini:
Balanced And/Or Trees and Linear Threshold Functions. ANALCO 2009: 51-57 - 2008
- [c11]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
Complexity and Limiting Ratio of Boolean Functions over Implication. MFCS 2008: 347-362 - 2007
- [c10]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc:
Classical and Intuitionistic Logic Are Asymptotically Identical. CSL 2007: 177-193 - 2004
- [j17]Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger:
And/Or Trees Revisited. Comb. Probab. Comput. 13(4-5): 475-497 (2004) - [j16]Michael Drmota, Danièle Gardy, Bernhard Gittenberger:
General urn models with several types of balls and Gaussian limiting fields. Random Struct. Algorithms 24(1): 75-103 (2004) - [i1]Cyril Banderier, Philippe Flajolet, Danièle Gardy, Mireille Bousquet-Mélou, Alain Denise, Dominique Gouyou-Beauchamps:
Generating functions for generating trees. CoRR math.CO/0411250 (2004) - 2003
- [j15]Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise:
The permutation-path coloring problem on trees. Theor. Comput. Sci. 297(1-3): 119-143 (2003) - 2002
- [j14]Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps:
Generating functions for generating trees. Discret. Math. 246(1-3): 29-55 (2002) - 2001
- [j13]Michael Drmota, Danièle Gardy, Bernhard Gittenberger:
A Unified Presentation of Some Urn Models. Algorithmica 29(1): 120-147 (2001) - 2000
- [c9]Dominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy, Mario Valencia-Pabon:
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract. LATIN 2000: 308-317
1990 – 1999
- 1999
- [c8]Danièle Gardy, Laurent Némirovski:
Urn Models and Yao's Formula. ICDT 1999: 100-112 - 1998
- [c7]Danièle Gardy, Laurent Némirovski:
Formule de Yao et modèles d'urnes. BDA 1998 - 1997
- [j12]Stéphane Boucheron, Danièle Gardy:
An urn model from learning theory. Random Struct. Algorithms 10(1-2): 43-67 (1997) - 1995
- [j11]Danièle Gardy:
Some results on the asymptotic behaviour of coefficients of large powers of functions. Discret. Math. 139(1-3): 189-217 (1995) - [j10]Danièle Gardy, Guy Louchard:
Dynamic Analysis of some Relational Databases Parameters. Theor. Comput. Sci. 144(1&2): 125-159 (1995) - [c6]Danièle Gardy, Guy Louchard:
Dynamic Analysis of the Sizes of Relations. STACS 1995: 433-444 - 1994
- [j9]Danièle Gardy:
Join Sizes, urn Models and Normal Limiting Distributions. Theor. Comput. Sci. 131(2): 375-414 (1994) - 1992
- [j8]Philippe Flajolet, Danièle Gardy, Loÿs Thimonier:
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. Discret. Appl. Math. 39(3): 207-229 (1992) - [j7]Danièle Gardy, Dominique Gouyou-Beauchamps:
Enumerating Davenport-Schinzel sequences. RAIRO Theor. Informatics Appl. 26: 387-402 (1992) - [j6]Danièle Gardy:
Normal Limiting Distributions for Projection and Semijoin Sizes. SIAM J. Discret. Math. 5(2): 219-248 (1992) - [j5]Danièle Gardy:
Methode de col et lois limites en analyse combinatoire. Theor. Comput. Sci. 94(2): 261-280 (1992) - 1991
- [c5]Danièle Gardy, Patrick Solé:
Saddle Point Techniques in Asymptotic Coding Theory. Algebraic Coding 1991: 75-81
1980 – 1989
- 1989
- [j4]Danièle Gardy, Philippe Flajolet, Claude Puech:
Average cost of orthogonal range queries in multiattribute trees. Inf. Syst. 14(4): 341-350 (1989) - [j3]Danièle Gardy, Claude Puech:
On the Effects of Join Operations on Relation Sizes. ACM Trans. Database Syst. 14(4): 574-603 (1989) - [c4]Danièle Gardy, Philippe Flajolet, Claude Puech:
On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. WADS 1989: 218-229 - 1988
- [c3]Philippe Flajolet, Danièle Gardy, Loÿs Thimonier:
Random Allocations and Probabilistic Languages. ICALP 1988: 239-253 - 1984
- [j2]Danièle Gardy, Claude Puech:
On the sizes of projections: a generating function approach. Inf. Syst. 9(3/4): 231-235 (1984) - [c2]Danièle Gardy, Claude Puech:
Relational Algebra Operations and Sizes of Relations. ICALP 1984: 174-186 - 1982
- [j1]Erol Gelenbe, Danièle Gardy:
On the Size of Projections: I. Inf. Process. Lett. 14(1): 18-21 (1982) - [c1]Erol Gelenbe, Danièle Gardy:
The Size of Projections of Relations Satisfying a Functional Dependency. VLDB 1982: 325-333
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint