L. Devroye, A Limit Theory for Random Skip Lists, The Annals of Applied Probability, vol.2, issue.3, pp.597-609, 1992.
DOI : 10.1214/aoap/1177005651

M. Drmota and B. Gittenberger, The distribution of nodes of given degree in random trees, Journal of Graph Theory, vol.A, issue.3, pp.227-253, 1999.
DOI : 10.1002/(SICI)1097-0118(199907)31:3<227::AID-JGT6>3.0.CO;2-6

G. Fayolle, . Ph, M. Flajolet, and . 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, 1986.
DOI : 10.1109/TIT.1985.1057014
URL : https://hal.archives-ouvertes.fr/inria-00076429

P. Feldman, S. T. Rachev, and L. Rüschendorf, Limit theorems for recursive algorithms, Journal of Computational and Applied Mathematics, vol.56, issue.1-2, pp.169-182, 1994.
DOI : 10.1016/0377-0427(94)90386-7

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

P. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger, and R. Tichy, Mellin transforms and asymptotics: digital sums, Theoretical Computer Science, vol.123, issue.2, pp.291-314, 1994.
DOI : 10.1016/0304-3975(92)00065-Y
URL : https://hal.archives-ouvertes.fr/inria-00075064

P. Flajolet and A. M. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019
URL : https://hal.archives-ouvertes.fr/inria-00075725

E. Fredkin, Trie memory, Communications of the ACM, vol.3, issue.9, pp.490-500, 1960.
DOI : 10.1145/367390.367400

I. G. Grama, On moderate deviations for martingales, The Annals of Probability, vol.25, issue.1, pp.152-183, 1997.
DOI : 10.1214/aop/1024404283
URL : https://hal.archives-ouvertes.fr/hal-01270031

W. Gutjahr, G. Ch, and . Pflug, The asymptotic contour process of a binary tree is a Brownian excursion, Stochastic Processes Appl, pp.41-69, 1992.

E. Haeusler, On the Rate of Convergence in the Central Limit Theorem for Martingales with Discrete and Continuous Time, The Annals of Probability, vol.16, issue.1, pp.275-299, 1988.
DOI : 10.1214/aop/1176991901

C. C. Heyde and B. M. Brown, On the departure from normality of a certain class of martingales, Ann. Math. Statist, pp.41-2161, 1970.

P. Jacquet and M. Régnier, Normal limiting distribution of the size of tries Proc, Performance, vol.87, pp.209-223, 1988.

P. Jacquet and M. Régnier, Normal limiting distribution for the size and the external path length of tries, INRIA Research Report, vol.827, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00075724

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 and its applications, Theoretical Computer Science, vol.201, issue.1-2, pp.1-62, 1998.
DOI : 10.1016/S0304-3975(97)00167-9

P. Kirschenhofer and H. Prodinger, On some applications of formulae of Ramanujan in the analysis of algorithms, Mathematika, vol.2, issue.01, pp.14-33, 1991.
DOI : 10.1016/0304-3975(79)90009-4

G. Louchard, Trie size in a dynamic list structure, Random Struct, Algorithms, vol.5, pp.665-702, 1994.

H. M. Mahmoud, P. Flajolet, P. Jacquet, and M. Régnier, Analytic variations on bucket selection and sorting, Acta Informatica, vol.36, issue.9-10, pp.735-760, 2000.
DOI : 10.1007/s002360050173
URL : https://hal.archives-ouvertes.fr/inria-00073290

H. M. Mahmoud and B. , Analysis of the space of search trees under the random insertion algorithm, Journal of Algorithms, vol.10, issue.1, pp.52-75, 1989.
DOI : 10.1016/0196-6774(89)90023-0

H. M. Mahmoud and R. T. Smythe, Probabilistic analysis of bucket recursive trees, Theoretical Computer Science, vol.144, issue.1-2, pp.221-249, 1995.
DOI : 10.1016/0304-3975(94)00308-6

S. T. Rachev and L. Rüschendorf, Probability metrics and recursive algorithms, Advances in Applied Probability, vol.II, issue.03, pp.770-799, 1995.
DOI : 10.1214/aop/1176992167

M. Régnier, A limiting distribution for quicksort, Theoretical Informatics and Applications, pp.335-343, 1989.
DOI : 10.1051/ita/1989230303351

U. Rösler, A limit theorem for ???quicksort???, Theoretical Informatics and Applications, pp.85-100, 1991.
DOI : 10.1051/ita/1991250100851

U. Rösler, On the analysis of stochastic divide and conquer algorithms, Algorithmica, vol.7, issue.1-2, pp.238-261, 2001.
DOI : 10.1007/BF02679621

U. Rösler and L. Rüschendorf, The contraction method for recursive algorithms, Algorithmica, vol.25, issue.2, pp.3-33, 2001.
DOI : 10.1007/BF02679611

W. Schachinger, On the variance of a class of inductive valuations of data structures for digital search, Theoretical Computer Science, vol.144, issue.1-2, pp.251-275, 1995.
DOI : 10.1016/0304-3975(94)00306-4

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

D. Williams, Probability with Martingales, 1991.
DOI : 10.1017/CBO9780511813658