Bibliographie
499
97. P. Flajolet, M. Régnier, D. Sotteau, Algebraic methods for trie statistics. Ann. Discret. Math.
25, 145–188 (1985). In Analysis and Design of Algorithms for Combinatorial Problems, ed.
by G. Ausiello, M. Lucertini (Invited Lecture)
98. P. Flajolet, Z. Gao, A. Odlyzko, B. Richmond, The distribution of heights of binary trees and
other simple trees. Comb. Probab. Comput. 2, 145–156 (1993)
99. P. Flajolet, G. Gonnet, C. Puech, J. Robson, Analytic variations on quadtrees. Algorithmica
10(6), 473–500 (1993)
100. P. Flajolet, X. Gourdon, P. Dumas, Mellin transforms and asymptotics: harmonic sums. Theor.
Comput. Sci. 144(1–2), 3–58 (1995)
101. P. Flajolet, G. Labelle, L. Laforest, B. Salvy, Hypergeometrics and the cost structure of
quadtrees. Random Struct. Algoritm. 7(2), 117–144 (1995)
102. P. Flajolet, J. Gabarró, H. Pekari, Analytic urns. Ann. Probab. 33(3), 1200–1233 (2005)
103. P. Flajolet, P. Dumas, V. Puyhaubert, Some exactly solvable models of urn process theory, in
DMTCS Proceedings, vol. AG (2006), pp. 59–118
104. P. Flajolet, E. Fusy, O. Gandouet, F. Meunier, Hyperloglog: the analysis of a near-optimal
cardinality estimation algorithm, in DMTCS Proceedings, vol. AH (2007), pp. 127–146
105. P. Flajolet, M. Roux, B. Vallée. Digital trees and memoryless sources: from arithmetics to
analysis, in Proceedings of AofA’10, DMTCS, Proc AM (2010), pp. 231–258
106. R. Floyd, Algorithm 24. Treesort 3. Commun. ACM 7(12) (1964)
107. H. Fournier, D. Gardy, A. Genitrini, M. Zaionc, Classical and intuitionistic logic are
asymptotically identical, in Computer Science Logic, Proceedings of the 21st International
Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, 11–15 September
2007, pp. 177–193
108. H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger, The fraction of large random trees
representing a given boolean function in implicational logic. Random Struct. Algoritm. 20(7),
875–887 (2012)
109. E. Fredkin, Trie memory. Commun. ACM 3(9), 490–499 (1960)
110. A. Frieze, On the random construction of heaps. Inf. Process. Lett. 27, 103–109 (1988)
111. C. Froidevaux, M.-C. Gaudel, M. Soria, Types de données et Algorithmes (McGraw Hill,
Paris, 1993)
112. M. Fuchs, H. Hwang, R. Neininger, Profiles of random trees: limit theorems for random
recursive trees and binary search trees. Algorithmica 46, 367–407 (2006)
113. M. Fuchs, H.-K. Hwang, V. Zacharovas, An analytic approach to the asymptotic variance of
trie statistics and related structures. Theor. Comput. Sci. 527, 1–36 (2014)
114. Z. Galil, G.N. Italiano, Data structures and algorithms for disjoint set union problems. ACM
Comput. Surv. 2(3) (1991)
115. D. Gardy, Random boolean expressions, in DMTCS Proceedings AF (2006), pp. 1–36. Invited
paper, Colloquium on Computational Logic and Applications, Chambéry, Juin 2005
116. O. Garet, A. Kurtzmann, De l’intégration aux probabilités (Ellipses, Paris, 2011)
117. A. Genitrini, J. Kozik, In the full propositional logic, 5/8 of classical tautologies are
intuitionistically valid. Ann. Pure Appl. Logic 163(7), 875–887 (2012)
118. A. Genitrini, C. Mailler, Generalised and quotient models for random and/or trees and
application to satisfiability. Algorithmica 76(4), 1106–1138 (2016)
119. A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler, Associative and commutative tree
representations for boolean functions. Theor. Comput. Sci. 570, 70–101 (2015)
120. R. Gouet, Martingale functional central limit theorems for a generalized Pólya urn. Ann.
Probab. 21(3), 1624–1639 (1993)
121. R. Gouet, Strong convergence of proportions in a multicolor Pólya urn. J. Appl. Probab. 34,
426–435 (1997)
122. R.L. Graham, D.E. Knuth, O. Patashnik, Mathématiques concrètes, deuxième edition. (Intern.
Thomson Publishing, Paris, 1998). Traduction française par A. Denise,
123. D.H. Greene, D.E. Knuth, Mathematics for the Analysis of Algorithms (Birkhäuser, Basel,
1981). Third edition, 1990
499
97. P. Flajolet, M. Régnier, D. Sotteau, Algebraic methods for trie statistics. Ann. Discret. Math.
25, 145–188 (1985). In Analysis and Design of Algorithms for Combinatorial Problems, ed.
by G. Ausiello, M. Lucertini (Invited Lecture)
98. P. Flajolet, Z. Gao, A. Odlyzko, B. Richmond, The distribution of heights of binary trees and
other simple trees. Comb. Probab. Comput. 2, 145–156 (1993)
99. P. Flajolet, G. Gonnet, C. Puech, J. Robson, Analytic variations on quadtrees. Algorithmica
10(6), 473–500 (1993)
100. P. Flajolet, X. Gourdon, P. Dumas, Mellin transforms and asymptotics: harmonic sums. Theor.
Comput. Sci. 144(1–2), 3–58 (1995)
101. P. Flajolet, G. Labelle, L. Laforest, B. Salvy, Hypergeometrics and the cost structure of
quadtrees. Random Struct. Algoritm. 7(2), 117–144 (1995)
102. P. Flajolet, J. Gabarró, H. Pekari, Analytic urns. Ann. Probab. 33(3), 1200–1233 (2005)
103. P. Flajolet, P. Dumas, V. Puyhaubert, Some exactly solvable models of urn process theory, in
DMTCS Proceedings, vol. AG (2006), pp. 59–118
104. P. Flajolet, E. Fusy, O. Gandouet, F. Meunier, Hyperloglog: the analysis of a near-optimal
cardinality estimation algorithm, in DMTCS Proceedings, vol. AH (2007), pp. 127–146
105. P. Flajolet, M. Roux, B. Vallée. Digital trees and memoryless sources: from arithmetics to
analysis, in Proceedings of AofA’10, DMTCS, Proc AM (2010), pp. 231–258
106. R. Floyd, Algorithm 24. Treesort 3. Commun. ACM 7(12) (1964)
107. H. Fournier, D. Gardy, A. Genitrini, M. Zaionc, Classical and intuitionistic logic are
asymptotically identical, in Computer Science Logic, Proceedings of the 21st International
Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, 11–15 September
2007, pp. 177–193
108. H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger, The fraction of large random trees
representing a given boolean function in implicational logic. Random Struct. Algoritm. 20(7),
875–887 (2012)
109. E. Fredkin, Trie memory. Commun. ACM 3(9), 490–499 (1960)
110. A. Frieze, On the random construction of heaps. Inf. Process. Lett. 27, 103–109 (1988)
111. C. Froidevaux, M.-C. Gaudel, M. Soria, Types de données et Algorithmes (McGraw Hill,
Paris, 1993)
112. M. Fuchs, H. Hwang, R. Neininger, Profiles of random trees: limit theorems for random
recursive trees and binary search trees. Algorithmica 46, 367–407 (2006)
113. M. Fuchs, H.-K. Hwang, V. Zacharovas, An analytic approach to the asymptotic variance of
trie statistics and related structures. Theor. Comput. Sci. 527, 1–36 (2014)
114. Z. Galil, G.N. Italiano, Data structures and algorithms for disjoint set union problems. ACM
Comput. Surv. 2(3) (1991)
115. D. Gardy, Random boolean expressions, in DMTCS Proceedings AF (2006), pp. 1–36. Invited
paper, Colloquium on Computational Logic and Applications, Chambéry, Juin 2005
116. O. Garet, A. Kurtzmann, De l’intégration aux probabilités (Ellipses, Paris, 2011)
117. A. Genitrini, J. Kozik, In the full propositional logic, 5/8 of classical tautologies are
intuitionistically valid. Ann. Pure Appl. Logic 163(7), 875–887 (2012)
118. A. Genitrini, C. Mailler, Generalised and quotient models for random and/or trees and
application to satisfiability. Algorithmica 76(4), 1106–1138 (2016)
119. A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler, Associative and commutative tree
representations for boolean functions. Theor. Comput. Sci. 570, 70–101 (2015)
120. R. Gouet, Martingale functional central limit theorems for a generalized Pólya urn. Ann.
Probab. 21(3), 1624–1639 (1993)
121. R. Gouet, Strong convergence of proportions in a multicolor Pólya urn. J. Appl. Probab. 34,
426–435 (1997)
122. R.L. Graham, D.E. Knuth, O. Patashnik, Mathématiques concrètes, deuxième edition. (Intern.
Thomson Publishing, Paris, 1998). Traduction française par A. Denise,
123. D.H. Greene, D.E. Knuth, Mathematics for the Analysis of Algorithms (Birkhäuser, Basel,
1981). Third edition, 1990