G. Brassard and P. Bratley, Algorithmics: Theory and Practice, 1988.

L. Devroye, A Study of Trie-Like Structures Under the Density Model, The Annals of Applied Probability, vol.2, issue.2, pp.402-434, 1992.
DOI : 10.1214/aoap/1177005709

G. Fayolle, P. Flajolet, and M. Hofri, On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel, Advances in Applied Probability, vol.19, issue.02, pp.441-472, 1984.
DOI : 10.1109/TIT.1985.1057014

URL : https://hal.archives-ouvertes.fr/inria-00076429

J. A. Fill, H. M. Mahmoud, and W. Szpankowski, On the distribution for the duration of a randomized leader election algorithm, The Annals of Applied Probability, vol.6, issue.4, 1996.
DOI : 10.1214/aoap/1035463332

P. Flajolet, M. Régnier, and D. Sotteau, Algebraic Methods for Trie Statistics, Annals of Discrete Mathematics, vol.25, pp.145-188, 1985.
DOI : 10.1016/S0304-0208(08)73107-4

URL : https://hal.archives-ouvertes.fr/inria-00076259

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995.
DOI : 10.1016/0304-3975(95)00002-E

URL : https://hal.archives-ouvertes.fr/inria-00074307

G. Gonnet and J. Munro, The analysis of linear probing sort by the use of a new mathematical transform, Journal of Algorithms, vol.5, issue.4, pp.451-470, 1984.
DOI : 10.1016/0196-6774(84)90001-4

P. Grabner, Searching for losers. Random Structures and Algorithms, pp.99-110, 1993.

P. Jacquet and M. Régnier, Trie partitioning process: Limiting distributions, Lecture Notes in Computer Science, vol.214, pp.196-210, 1986.
DOI : 10.1007/BFb0022669

P. Jacquet and M. Régnier, Normal Limiting Distribution of the Size of Tries, Proc. Performance'87, pp.209-223, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00075724

P. Jacquet and W. Szpankowski, Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation, SIAM Journal on Computing, vol.18, issue.4, pp.777-791, 1989.
DOI : 10.1137/0218054

P. Jacquet and W. Szpankowski, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Theoretical Computer Science, vol.144, issue.1-2, pp.161-197, 1995.
DOI : 10.1016/0304-3975(94)00298-W

P. Jacquet and W. Szpankowski, Analytical Depoissonization Lemma and Its Applications
DOI : 10.1016/s0304-3975(97)00167-9

URL : http://doi.org/10.1016/s0304-3975(97)00167-9

L. Kuipers and H. Niederreiter, Uniform Distribution of Sequences, 1974.

H. Mahmoud, Evolution of Random Search Trees, 1992.

H. Prodinger, How to select a loser, Discrete Mathematics, vol.120, issue.1-3, pp.149-159, 1993.
DOI : 10.1016/0012-365X(93)90572-B

B. Rais, P. Jacquet, and W. Szpankowski, Limiting Distribution for the Depth in PATRICIA Tries, SIAM Journal on Discrete Mathematics, vol.6, issue.2, pp.355-362, 1993.
DOI : 10.1137/0406016

U. Schmid, The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects, Proc. ICALP 92, pp.223-234, 1992.
DOI : 10.1007/3-540-55719-9_76

W. Szpankowski, Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.233-250, 1987.
DOI : 10.1137/0608021

I. Unité-de-recherche, V. Lorraine, . Le-`-sle-`-le-`-s, and . Nancy, Technopôle de Nancy-Brabois, Campus scientifique

I. Unité-de-recherche, . Rennes, C. Irisa, . Universitaire, and . Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 2004.