Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Danièle Gardy

dblp:33/759 · DBLP profile ↗
← Back
23ranked-venue papers
11as first author
0since 2021 · last 2016
0000-0001-6425-4585ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 18 · 7 first-authorDatabases, data management, data science and information retrieval · 6 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Query processing and optimization · 44% Database theory · 41% Data models and query languages · 15%
Theoretical computer science
1 paper
Algorithms and data structures · 44% Algorithmic game theory and mechanism design · 44% Automata and formal languages · 13%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
cardinality estimation
0.011989
On the Effects of Join Operations on Relation Sizes · ACM Trans. Database Syst. 1989
Algorithms and data structures
analysis of algorithms
0.011988
Random Allocations and Probabilistic Languages · ICALP 1988
Algorithmic game theory and mechanism design › fair division
random assignment
0.011988
Random Allocations and Probabilistic Languages · ICALP 1988
Data models and query languages
relational algebra
0.011984
Relational Algebra Operations and Sizes of Relations · ICALP 1984
Query processing and optimization › query execution
relational operators
0.011984
Relational Algebra Operations and Sizes of Relations · ICALP 1984
Database theory › dependency theory
functional dependency
0.011982
The Size of Projections of Relations Satisfying a Functional Dependency · VLDB 1982
Automata and formal languages › probabilistic automata
probabilistic languages
0.011988
Random Allocations and Probabilistic Languages · ICALP 1988

Methods — techniques the papers use, named apart from their topics

probabilistic estimation · 0.0generating function approach · 0.0probability theory · 0.0analytic combinatorics · 0.0
YearPublicationVenuePosition
2016 2-Xor Revisited: Satisfiability and Probabilities of Functions
Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba
Algorithmica2
2014 Probabilities of 2-Xor Functions
Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba
LATIN2
2013 Asymptotics and random sampling for BCI and BCK lambda terms
Olivier Bodini, Danièle Gardy, Alice Jacquot
Theor. Comput. Sci.2
2012 Boys-and-girls Birthdays and Hadamard Products
abstract
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
Olivier Bodini, Danièle Gardy, Olivier Roussel
Fundam. Informaticae2
2008 Complexity and Limiting Ratio of Boolean Functions over Implication
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
MFCS2
2003 The permutation-path coloring problem on trees
Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise
Theor. Comput. Sci.3
2001 A Unified Presentation of Some Urn Models
Michael Drmota, Danièle Gardy, Bernhard Gittenberger
Algorithmica2
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
LATIN4
1999 Urn Models and Yao's Formula
Danièle Gardy, Laurent Némirovski
ICDT1
1995 Dynamic Analysis of the Sizes of Relations
Danièle Gardy, Guy Louchard
STACS1
1995 Dynamic Analysis of some Relational Databases Parameters
Danièle Gardy, Guy Louchard
Theor. Comput. Sci.1
1994 Join Sizes, urn Models and Normal Limiting Distributions
Danièle Gardy
Theor. Comput. Sci.1
1992 Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search
Philippe Flajolet, Danièle Gardy, Loÿs Thimonier
Discret. Appl. Math.2
1992 Normal Limiting Distributions for Projection and Semijoin Sizes
abstract
This paper presents classes of bivariate generating functions associated with the probability distributions of parameters on sets of points (sizes of derived relations in a relational data base) that correspond to asymptotically normal distributions. These results are extended to give some conditions under which the numbers $a_{n,k} $ defined by $\sum_{n,k} a_{n,k} x^k y^n = \phi ( x,y )^d $ follow a Gaussian limiting distribution.
Danièle Gardy
SIAM J. Discret. Math.1
1992 Methode de col et lois limites en analyse combinatoire
Danièle Gardy
Theor. Comput. Sci.1
1989 On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees
Danièle Gardy, Philippe Flajolet, Claude Puech
WADS1
1989 Average cost of orthogonal range queries in multiattribute trees
Danièle Gardy, Philippe Flajolet, Claude Puech
Inf. Syst.1
1989 On the Effects of Join Operations on Relation Sizes
abstract
We propose a generating function approach to the problem of evaluating the sizes of derived relations in a relational database framework. We present a model of relations and show how to use it to deduce probabilistic estimations of derived relation sizes. These are found to asymptotically follow normal distributions under a variety of assumptions.
Danièle Gardy, Claude Puech
ACM Trans. Database Syst.1
1988 Random Allocations and Probabilistic Languages
Philippe Flajolet, Danièle Gardy, Loÿs Thimonier
ICALP2
1984 Relational Algebra Operations and Sizes of Relations
Danièle Gardy, Claude Puech
ICALP1
1984 On the sizes of projections: a generating function approach
Danièle Gardy, Claude Puech
Inf. Syst.1
1982 The Size of Projections of Relations Satisfying a Functional Dependency
Erol Gelenbe, Danièle Gardy
VLDB2
1982 On the Size of Projections: I
Erol Gelenbe, Danièle Gardy
Inf. Process. Lett.2