498
Bibliographie
73. M. Durand, P. Flajolet, Loglog counting of large cardinalities, in ESA03, 11th Annual
European Symposium on Algorithms, Engineering and Applications Track. Lecture Notes in
Computer Science (Springer, Berlin, 2003), pp. 605–617
74. R. Durrett, Probability. Theory and Examples, 4th edn. (Cambridge University Press,
Cambridge, 2010)
75. R. Fagin, J. Nievergelt, N. Pippenger, H.R. Strong, Extendible hashing - a fast access method
for dynamic files. ACM Trans. Database Syst. 4(3), 315–344 (1979)
76. J. Fill, S. Janson, Smoothness and decay properties of the limiting quicksort density function,
in Mathematics and Computer Science. Trends in Mathematics (Birkhäuser, Basel, 2000),
pp. 53–64
77. J.A. Fill, S. Janson, The number of bit comparisons used by Quicksort: an average-case
analysis. Electron. J. Probab 17(43), 1–22 (2012)
78. J. Fill, H. Mahmoud, W. Szpankowski, On the distribution for the duration of a randomized
leader election algorithm. Ann. Appl. Probab. 6(4), 1260–1283 (1996)
79. P. Flajolet, On the performance evaluation of extendible hashing and trie searching. Acta
Inform. 20, 345–369 (1983)
80. P. Flajolet, Approximate counting: a detailed analysis. BIT Numer. Math. 25, 113–134 (1985)
81. P. Flajolet, On adaptive sampling. Computing 43, 391–400 (1990)
82. P. Flajolet, Counting by coin tossing, in Proceedings of Asian’04, ed. by M. Maher. Number
3321 in Lecture Notes in Computer Science (Springer, Berlin, 2004), pp. 1–12
83. P. Flajolet, The ubiquitous digital tree, in Proceedings of 23rd Annual Symposium on
Theoretical Aspects of Computer Science, STACS 2006, Marseille, 23–25 February 2006.
Lecture Notes in Computer Science, vol. 3884 (Springer, Berlin, 2006), pp. 1–22
84. P. Flajolet, M. Hoshi, Page usage in a quadtree index. BIT Numer. Math. 32, 384–402 (1992)
85. P. Flajolet, P. Jacquet, Analytic models for tree communication protocols, in Flow Control
of Congested Networks, ed. by A.R. Odoni, L. Bianco, G. Szegö (Springer, Berlin, 1987),
pp. 223–234
86. P. Flajolet, T. Lafforgue, Search costs in quadtrees and singularity perturbation asymptotics.
Discret. Comput. Geom. 12(4), 151–175 (1994)
87. P. Flajolet, G. Martin, Probabilistic counting algorithms for data base applications. J. Comput.
Syst. Sci. 31(2), 182–209 (1985)
88. P. Flajolet, A. Odlyzko, The average height of binary trees and other simple trees. J. Comput.
Syst. Sci. 25, 171–213 (1982)
89. P. Flajolet, A. Odlyzko, Limit distributions for coefficients of iterates of polynomials with
applications to combinatorial enumerations. Math. Proc. Camb. Philos. Soc. 96(2), 237–253
(1984)
90. P. Flajolet, A.M. Odlyzko, Singularity analysis of generating functions. SIAM J. Discret.
Math. 3(2), 216–240 (1990)
91. P. Flajolet, B. Richmond, Generalized digital trees and their difference—differential
equations. Random Struct. Algoritm. 3(3), 305–320 (1992)
92. P. Flajolet, R. Sedgewick, Digital search trees revisited. SIAM J. Comput. 15(3), 748–767
(1986)
93. P. Flajolet, R. Sedgewick, Mellin transforms and asymptotics: finite differences and Rice’s
integrals. Theor. Comput. Sci. 144(1&2), 101–124 (1995)
94. P. Flajolet, R. Sedgewick, Analytic Combinatorics (Cambridge University Press, Cambridge,
2009)
95. P. Flajolet, J.-M. Steyaert, A complexity calculus for classes of recursive search programs
over tree structures, in 22nd Annual Symposium on Foundations of Computer Science, 1981,
SFCS’81 (IEEE, Washington, 1981), pp. 386–393
96. P. Flajolet, J.-M. Steyaert, A branching process arising in dynamic hashing, trie searching
and polynomial factorization, in Automata, Languages and Programming, ed. by M. Nielsen,
E.M. Schmidt. Lecture Notes in Computer Science, vol. 140 (Springer, Berlin, 1982),
pp. 239–251. Proceedings of 9th ICALP Colloquium, Aarhus, July 1982
Bibliographie
73. M. Durand, P. Flajolet, Loglog counting of large cardinalities, in ESA03, 11th Annual
European Symposium on Algorithms, Engineering and Applications Track. Lecture Notes in
Computer Science (Springer, Berlin, 2003), pp. 605–617
74. R. Durrett, Probability. Theory and Examples, 4th edn. (Cambridge University Press,
Cambridge, 2010)
75. R. Fagin, J. Nievergelt, N. Pippenger, H.R. Strong, Extendible hashing - a fast access method
for dynamic files. ACM Trans. Database Syst. 4(3), 315–344 (1979)
76. J. Fill, S. Janson, Smoothness and decay properties of the limiting quicksort density function,
in Mathematics and Computer Science. Trends in Mathematics (Birkhäuser, Basel, 2000),
pp. 53–64
77. J.A. Fill, S. Janson, The number of bit comparisons used by Quicksort: an average-case
analysis. Electron. J. Probab 17(43), 1–22 (2012)
78. J. Fill, H. Mahmoud, W. Szpankowski, On the distribution for the duration of a randomized
leader election algorithm. Ann. Appl. Probab. 6(4), 1260–1283 (1996)
79. P. Flajolet, On the performance evaluation of extendible hashing and trie searching. Acta
Inform. 20, 345–369 (1983)
80. P. Flajolet, Approximate counting: a detailed analysis. BIT Numer. Math. 25, 113–134 (1985)
81. P. Flajolet, On adaptive sampling. Computing 43, 391–400 (1990)
82. P. Flajolet, Counting by coin tossing, in Proceedings of Asian’04, ed. by M. Maher. Number
3321 in Lecture Notes in Computer Science (Springer, Berlin, 2004), pp. 1–12
83. P. Flajolet, The ubiquitous digital tree, in Proceedings of 23rd Annual Symposium on
Theoretical Aspects of Computer Science, STACS 2006, Marseille, 23–25 February 2006.
Lecture Notes in Computer Science, vol. 3884 (Springer, Berlin, 2006), pp. 1–22
84. P. Flajolet, M. Hoshi, Page usage in a quadtree index. BIT Numer. Math. 32, 384–402 (1992)
85. P. Flajolet, P. Jacquet, Analytic models for tree communication protocols, in Flow Control
of Congested Networks, ed. by A.R. Odoni, L. Bianco, G. Szegö (Springer, Berlin, 1987),
pp. 223–234
86. P. Flajolet, T. Lafforgue, Search costs in quadtrees and singularity perturbation asymptotics.
Discret. Comput. Geom. 12(4), 151–175 (1994)
87. P. Flajolet, G. Martin, Probabilistic counting algorithms for data base applications. J. Comput.
Syst. Sci. 31(2), 182–209 (1985)
88. P. Flajolet, A. Odlyzko, The average height of binary trees and other simple trees. J. Comput.
Syst. Sci. 25, 171–213 (1982)
89. P. Flajolet, A. Odlyzko, Limit distributions for coefficients of iterates of polynomials with
applications to combinatorial enumerations. Math. Proc. Camb. Philos. Soc. 96(2), 237–253
(1984)
90. P. Flajolet, A.M. Odlyzko, Singularity analysis of generating functions. SIAM J. Discret.
Math. 3(2), 216–240 (1990)
91. P. Flajolet, B. Richmond, Generalized digital trees and their difference—differential
equations. Random Struct. Algoritm. 3(3), 305–320 (1992)
92. P. Flajolet, R. Sedgewick, Digital search trees revisited. SIAM J. Comput. 15(3), 748–767
(1986)
93. P. Flajolet, R. Sedgewick, Mellin transforms and asymptotics: finite differences and Rice’s
integrals. Theor. Comput. Sci. 144(1&2), 101–124 (1995)
94. P. Flajolet, R. Sedgewick, Analytic Combinatorics (Cambridge University Press, Cambridge,
2009)
95. P. Flajolet, J.-M. Steyaert, A complexity calculus for classes of recursive search programs
over tree structures, in 22nd Annual Symposium on Foundations of Computer Science, 1981,
SFCS’81 (IEEE, Washington, 1981), pp. 386–393
96. P. Flajolet, J.-M. Steyaert, A branching process arising in dynamic hashing, trie searching
and polynomial factorization, in Automata, Languages and Programming, ed. by M. Nielsen,
E.M. Schmidt. Lecture Notes in Computer Science, vol. 140 (Springer, Berlin, 1982),
pp. 239–251. Proceedings of 9th ICALP Colloquium, Aarhus, July 1982