The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Danièle Gardy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Danièle Gardy, Claude Puech
    On the Effects of Join Operations on Relation Sizes. [Citation Graph (15, 17)][DBLP]
    ACM Trans. Database Syst., 1989, v:14, n:4, pp:574-603 [Journal]
  2. Erol Gelenbe, Danièle Gardy
    The Size of Projections of Relations Satisfying a Functional Dependency. [Citation Graph (6, 4)][DBLP]
    VLDB, 1982, pp:325-333 [Conf]
  3. Erol Gelenbe, Danièle Gardy
    On the Size of Projections: I. [Citation Graph (5, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:1, pp:18-21 [Journal]
  4. Danièle Gardy, Claude Puech
    On the sizes of projections: a generating function approach. [Citation Graph (3, 0)][DBLP]
    Inf. Syst., 1984, v:9, n:3/4, pp:231-235 [Journal]
  5. Danièle Gardy, Claude Puech
    Relational Algebra Operations and Sizes of Relations. [Citation Graph (1, 0)][DBLP]
    ICALP, 1984, pp:174-186 [Conf]
  6. Dominique Gardy, Laurent Nemirosvki
    Formule de Yao et modèles d'urnes. [Citation Graph (0, 0)][DBLP]
    BDA, 1998, pp:- [Conf]
  7. Danièle Gardy, Patrick Solé
    Saddle Point Techniques in Asymptotic Coding Theory. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1991, pp:75-81 [Conf]
  8. Philippe Flajolet, Danièle Gardy, Loÿs Thimonier
    Random Allocations and Probabilistic Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:239-253 [Conf]
  9. Danièle Gardy, Laurent Némirovski
    Urn Models and Yao's Formula. [Citation Graph (0, 5)][DBLP]
    ICDT, 1999, pp:100-112 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:308-317 [Conf]
  11. Danièle Gardy, Guy Louchard
    Dynamic Analysis of the Sizes of Relations. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:433-444 [Conf]
  12. Danièle Gardy, Philippe Flajolet, Claude Puech
    On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:218-229 [Conf]
  13. Michael Drmota, Danièle Gardy, Bernhard Gittenberger
    A Unified Presentation of Some Urn Models. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:1, pp:120-147 [Journal]
  14. Cyril Banderier, Philippe Flajolet, Danièle Gardy, Mireille Bousquet-Mélou, Alain Denise, Dominique Gouyou-Beauchamps
    Generating functions for generating trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  15. Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger
    And/Or Trees Revisited. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:475-497 [Journal]
  16. Philippe Flajolet, Danièle Gardy, Loÿs Thimonier
    Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:39, n:3, pp:207-229 [Journal]
  17. Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps
    Generating functions for generating trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:246, n:1-3, pp:29-55 [Journal]
  18. Danièle Gardy, Philippe Flajolet, Claude Puech
    Average cost of orthogonal range queries in multiattribute trees. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1989, v:14, n:4, pp:341-350 [Journal]
  19. Danièle Gardy, Dominique Gouyou-Beauchamps
    Enumerating Davenport-Schinzel sequences. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:387-402 [Journal]
  20. Stéphane Boucheron, Danièle Gardy
    An urn model from learning theory. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:43-67 [Journal]
  21. Michael Drmota, Danièle Gardy, Bernhard Gittenberger
    General urn models with several types of balls and Gaussian limiting fields. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:1, pp:75-103 [Journal]
  22. Danièle Gardy
    Normal Limiting Distributions for Projection and Semijoin Sizes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:219-248 [Journal]
  23. Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise
    The permutation-path coloring problem on trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:119-143 [Journal]
  24. Danièle Gardy
    Methode de col et lois limites en analyse combinatoire. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:94, n:2, pp:261-280 [Journal]
  25. Danièle Gardy
    Join Sizes, urn Models and Normal Limiting Distributions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:375-414 [Journal]
  26. Danièle Gardy, Guy Louchard
    Dynamic Analysis of some Relational Databases Parameters. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:144, n:1&2, pp:125-159 [Journal]
  27. Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
    Classical and Intuitionistic Logic Are Asymptotically Identical. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:177-193 [Conf]
  28. Danièle Gardy
    Some results on the asymptotic behaviour of coefficients of large powers of functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:139, n:1-3, pp:189-217 [Journal]

  29. Complexity and Limiting Ratio of Boolean Functions over Implication. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002