[. Bruss and R. Grübel, On the multiplicity of the maximum in a discrete random sample, Ann. Appl. Probab, vol.13, pp.1252-1263, 2003.

P. Billingsley, Convergence of Probability Measures, 1968.
DOI : 10.1002/9780470316962

P. Billingsley, Probability and Measure, 1986.

]. H. Bvn46, A. W. Burks, J. Goldstine, and . Von-neumann, Preliminary discussion of the logical design of an electronic computing instrument, Inst. for Advanced Study Report, 1946.

S. Csörgö and Z. Megyesi, Merging to semistable laws, Teoriya Veroyatnostei i ee Primeneniya, vol.47, issue.1, pp.90-109, 2002.
DOI : 10.4213/tvp2999

B. Chauvin and N. Pouyanne, m-ary search trees when m ? 27: a strong asymptotics for the space requirements. Random Structures Algorithms, pp.133-154, 2004.

F. Dennert and R. Grübel, Renewals for exponentially increasing lifetimes, with an application to digital search trees, The Annals of Applied Probability, vol.17, issue.2, pp.676-687, 2007.
DOI : 10.1214/105051606000000862

P. Flajolet, Approximate counting: A detailed analysis, BIT, vol.21, issue.1, pp.113-134, 1985.
DOI : 10.1007/BF01934993

H. M. James-allen-fill, W. Mahmoud, and . Szpankowski, On the distribution for the duration of a randomized leader election algorithm, Ann. Appl. Probab, vol.6, pp.1260-1283, 1996.

R. Grübel and A. Reimers, On the number of iterations required by Von Neumann addition, RAIRO - Theoretical Informatics and Applications, vol.35, issue.2, pp.187-206, 2001.
DOI : 10.1051/ita:2001115

R. Grübel, A hooray for Poisson approximation, 2005 International Conference on Analysis of Algorithms, Discrete Math Proc., AD, pp.181-191, 2005.

S. Janson, Functional limit theorems for multitype branching processes and generalized Pólya urns. Stochastic Process, Appl, vol.110, issue.2, pp.177-245, 2004.

S. Janson, One-sided interval trees Rounding of continuous random variables and oscillatory asymptotics, Jan06] Svante Janson, pp.149-1641807, 2004.

S. Janson and R. Neininger, The size of random fragmentation trees, Probability Theory and Related Fields, vol.22, issue.3, 2006.
DOI : 10.1007/s00440-007-0110-1

]. G. Lou87 and . Louchard, Exact and asymptotic distributions in digital and binary search trees, RAIRO Inform. Théor. Appl, vol.21, pp.479-495, 1987.

G. Louchard and H. Prodinger, The Asymmetric Leader Election Algorithm: Another Approach, Annals of Combinatorics, vol.3, issue.1-3, 2006.
DOI : 10.1007/s00026-009-0004-2

M. Hosam and . Mahmoud, Evolution of Random Search Trees, 1992.

H. Prodinger, Periodic oscillations in the analysis of algorithms and their cancellations, J. Iranian Statistical Soc, vol.3, pp.251-270, 2004.

N. R. Scott, Computer Number Systems & Arithmetic, 1985.

R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, 1996.

R. Galen, J. A. Shorack, and . Wellner, Empirical Processes with Applications to Statistics, Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics, 1986.