Danièle Gardy

1.2k total citations
33 papers, 586 citations indexed

About

Danièle Gardy is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Danièle Gardy has authored 33 papers receiving a total of 586 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 13 papers in Computational Theory and Mathematics and 10 papers in Computer Networks and Communications. Recurrent topics in Danièle Gardy's work include Data Management and Algorithms (10 papers), semigroups and automata theory (9 papers) and Advanced Database Systems and Queries (9 papers). Danièle Gardy is often cited by papers focused on Data Management and Algorithms (10 papers), semigroups and automata theory (9 papers) and Advanced Database Systems and Queries (9 papers). Danièle Gardy collaborates with scholars based in France, Austria and United Kingdom. Danièle Gardy's co-authors include Philippe Flajolet, Loÿs Thimonier, Dominique Gouyou-Beauchamps, Cyril Banderier, Bernhard Gittenberger, Olivier Bodini, Claude Puech, Erol Gelenbe, Alan R. Woods and Michael Drmota and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Danièle Gardy

31 papers receiving 536 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Danièle Gardy France	10	223	184	157	147	92	33	586
Peter Kirschenhofer Austria	18	316 1.4×	104 0.6×	160 1.0×	198 1.3×	221 2.4×	58	683
Gyula O. H. Katona Hungary	19	201 0.9×	132 0.7×	537 3.4×	515 3.5×	54 0.6×	83	990
Johann A. Makowsky Israel	17	372 1.7×	280 1.5×	250 1.6×	966 6.6×	42 0.5×	80	1.2k
Hariharan Narayanan United States	11	126 0.6×	69 0.4×	55 0.4×	163 1.1×	38 0.4×	42	443
Shmuel Zaks Israel	18	215 1.0×	691 3.8×	154 1.0×	407 2.8×	35 0.4×	109	1.2k
L. H. Harper United States	12	146 0.7×	309 1.7×	280 1.8×	482 3.3×	140 1.5×	36	1.0k
Neil J. Calkin United States	11	137 0.6×	54 0.3×	177 1.1×	240 1.6×	79 0.9×	48	504
S. G. Mohanty Canada	13	105 0.5×	54 0.3×	113 0.7×	63 0.4×	121 1.3×	48	493
J. Kahn United States	7	201 0.9×	99 0.5×	138 0.9×	312 2.1×	79 0.9×	17	589
Michael Drmota Austria	16	275 1.2×	45 0.2×	179 1.1×	256 1.7×	522 5.7×	72	920

Countries citing papers authored by Danièle Gardy

Since Specialization

Citations

This map shows the geographic impact of Danièle Gardy's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Danièle Gardy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Danièle Gardy more than expected).

Fields of papers citing papers by Danièle Gardy

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Danièle Gardy. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Danièle Gardy. The network helps show where Danièle Gardy may publish in the future.

Co-authorship network of co-authors of Danièle Gardy

This figure shows the co-authorship network connecting the top 25 collaborators of Danièle Gardy. A scholar is included among the top collaborators of Danièle Gardy based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Danièle Gardy. Danièle Gardy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Panafieu, Élie de, et al.. (2018). Threshold functions for small subgraphs in simple graphs and multigraphs. HAL (Le Centre pour la Communication Scientifique Directe).

Chauvin, Brigitte, et al.. (2014). A sprouting tree model for random boolean functions. Random Structures and Algorithms. 47(4). 635–662. 2 indexed citations

Bodini, Olivier, et al.. (2013). Asymptotics and random sampling for BCI and BCK lambda terms. Theoretical Computer Science. 502. 227–238. 9 indexed citations

Gardy, Danièle, et al.. (2013). When is it worthwhile to propagate a constraint?: a probabilistic analysis of A ll D ifferent. 80–90. 1 indexed citations

Gardy, Danièle, et al.. (2013). When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent. HAL (Le Centre pour la Communication Scientifique Directe). 2 indexed citations

Bodini, Olivier, et al.. (2013). Enumeration of Generalized $BCI$ Lambda-terms. The Electronic Journal of Combinatorics. 20(4). 4 indexed citations

Bodini, Olivier, Danièle Gardy, & Bernhard Gittenberger. (2011). Lambda terms of bounded unary height. 23–32. 10 indexed citations

Fournier, Hervé, et al.. (2010). Tautologies over implication with negative literals. Mathematical logic quarterly. 56(4). 388–396. 3 indexed citations

Gardy, Danièle & Yann Ponty. (2010). Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

10.

Gardy, Danièle. (2005). Random Boolean expressions. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AF,...(Proceedings). 13 indexed citations

11.

Banderier, Cyril, Danièle Gardy, & Dominique Gouyou-Beauchamps. (2004). Generating functions for generating trees. 125 indexed citations

12.

Drmota, Michael, Danièle Gardy, & Bernhard Gittenberger. (2003). General urn models with several types of balls and Gaussian limiting fields. Random Structures and Algorithms. 24(1). 75–103. 1 indexed citations

13.

Corteel, Sylvie, et al.. (2003). The permutation-path coloring problem on trees. Theoretical Computer Science. 297(1-3). 119–143. 6 indexed citations

14.

Drmota, Michael, Danièle Gardy, & Bernhard Gittenberger. (2001). A unified presentation of some urn models. Algorithmica. 29(1-2). 120–147. 8 indexed citations

15.

Gardy, Danièle & Guy Louchard. (1995). Dynamic analysis of some relational databases parameters. Theoretical Computer Science. 144(1-2). 125–159. 5 indexed citations

16.

Gardy, Danièle. (1995). Some results on the asymptotic behaviour of coefficients of large powers of functions. Discrete Mathematics. 139(1-3). 189–217. 23 indexed citations

17.

Gardy, Danièle. (1994). Join sizes, urn models and normal limiting distributions. Theoretical Computer Science. 131(2). 375–414. 5 indexed citations

18.

Gardy, Danièle. (1992). Méthode de col et lois limites en analyse combinatoire. Theoretical Computer Science. 94(2). 261–280. 1 indexed citations

19.

Flajolet, Philippe, Danièle Gardy, & Loÿs Thimonier. (1992). Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Applied Mathematics. 39(3). 207–229. 273 indexed citations

20.

Gelenbe, Erol & Danièle Gardy. (1982). The Size of Projections of Relations Satisfying a Functional Dependency. Very Large Data Bases. 325–333. 14 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact