M. Archibald and J. Clément, Average depth in binary search tree with repeated keys, Fourth Colloquium on Mathematics and Computer Science, pp.309-320, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01184700

]. N. Bd07a, L. Broutin, and . Devroye, The core of a trie, 2007.

]. N. Bd07b, L. Broutin, and . Devroye, Weighted height of random tries, 2007.

N. Broutin, Shedding New Light on Random Trees, 2007.

G. G. Brown and B. O. Shubert, On Random Binary Trees, Mathematics of Operations Research, vol.9, issue.1, pp.43-65, 1984.
DOI : 10.1287/moor.9.1.43

J. L. Bentley and R. Sedgewick, Fast algorithm for sorting and searching strings, Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.360-369, 1997.

J. Clément, P. Flajolet, and B. Vallée, The analysis of hybrid trie structures, 9th annual ACM-SIAM Symposium on Discrete Algorithms, pp.531-539, 1998.

J. Clément, P. Flajolet, and B. Vallée, Dynamical sources in information theory: A general analysis of trie structures, Algorithmica, vol.11, issue.4, pp.307-369, 2001.
DOI : 10.1007/BF02679623

H. A. Clampett, Randomized binary searching with tree structures, Communications of the ACM, vol.7, issue.3, pp.163-165, 1964.
DOI : 10.1145/363958.363987

]. L. Dev84 and . Devroye, A probabilistic analysis of the height of tries and of the complexity of triesort, Acta Informatica, vol.21, pp.229-237, 1984.

]. L. Dev02 and . Devroye, Laws of large numbers and tail inequalities for random tries and PATRICIA trees, Journal of Computational and Applied Mathematics, vol.142, pp.27-37, 2002.

]. L. Dev05 and . Devroye, Universal asymptotics for random tries and PATRICIA trees File searching using variable length keys, Proceedings of the Western Joint Computer Conference, pp.11-29, 1959.

A. Dembo and O. Zeitouni, Large Deviation Techniques and Applications, 1998.

]. E. Fre60 and . Fredkin, Trie memory, Communications of the ACM, vol.3, issue.9, pp.490-499, 1960.

S. Janson, T. ?uczak, and A. Ruci´nskiruci´nski, Random Graphs, 2000.
DOI : 10.1002/9781118032718

D. E. Knuth, The Art of Computer Programming: Sorting and Searching, 1973.

W. C. Lynch, More Combinatorial Properties of Certain Trees, The Computer Journal, vol.7, issue.4, pp.299-302, 1965.
DOI : 10.1093/comjnl/7.4.299

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

G. Park, H. K. Hwang, P. Nicodème, W. Szpankowskipit85-]-b, and . Pittel, Profile of tries. Manuscript Asymptotic growth of a class of random trees. The Annals of Probability, 81] M. Régnier. On the average height of trees in digital search and dynamic hashing. Information Processing Letters, pp.414-42764, 1981.
URL : https://hal.archives-ouvertes.fr/hal-00781400

P. [. Sedgewick and . Flajolet, An Introduction to the Analysis of Algorithm, 1996.

]. W. Szp91 and . Szpankowski, On the height of digital trees and related problems, Algorithmica, vol.6, pp.256-277, 1991.

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770