J. E. Coffman and J. Eve, File structures using hashing functions, Communications of the ACM, vol.13, issue.7, pp.427-432, 1970.
DOI : 10.1145/362686.362693

M. Drmota, Random Trees, An Interplay Between Combinatorics and Probability, 2009.

M. Drmota and W. Szpankowski, The expected profile of digital search trees, Journal of Combinatorial Theory, Series A, vol.118, issue.7, 1939.
DOI : 10.1016/j.jcta.2011.04.001

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 and R. Sedgewick, Analytic Combinatorics, 2008.
DOI : 10.1017/CBO9780511801655

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

P. Jacquet and W. Szpankowski, Analysis of digital tries with Markovian dependency, IEEE Transactions on Information Theory, vol.37, issue.5, pp.1470-1475, 1991.
DOI : 10.1109/18.133271

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

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

P. Jacquet and M. R. A´egnier, Trie partitioning process: Limiting distributions, Lecture Notes in Comput. Sci, vol.214, pp.196-210, 1986.
DOI : 10.1007/BFb0022669

C. Knessl and W. Szpankowski, Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme, SIAM Journal on Computing, vol.30, issue.3, pp.923-964, 2000.
DOI : 10.1137/S0097539799356812

C. Knessl and W. Szpankowski, On the Average Profile of Symmetric Digital Search Trees, Analytic Combinatorics, vol.4, issue.6, 2009.

D. Knuth, The Art of Computer Programming, Sorting and Searching, vol.3, 1998.

M. Lothaire, Applied Combinatorics on Words, 2005.
DOI : 10.1017/CBO9781107341005

URL : https://hal.archives-ouvertes.fr/hal-00620607

G. Louchard, Exact and asymptotic distributions in digital and binary search trees, RAIRO - Theoretical Informatics and Applications, vol.21, issue.4, pp.479-495, 1987.
DOI : 10.1051/ita/1987210404791

G. Louchard and W. Szpankowski, Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm, IEEE Transactions on Information Theory, vol.41, issue.2, pp.478-488, 1995.
DOI : 10.1109/18.370149

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

G. Park, Profile of Tries, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00781400

H. Prodinger, Digital Search Trees and Basic Hypergeometric Functions, Bulletin of the EATCS, vol.56, 1995.

R. Sedgewick, Algorithms in C: Fundamental Algorithms, Data Structures, Sorting, Searching, 1997.

W. Szpankowski, A characterization of digital search trees from the successful search viewpoint, Theoretical Computer Science, vol.85, issue.1, pp.117-134, 1991.
DOI : 10.1016/0304-3975(91)90050-C

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