J. Fayolle, An Average-Case Analysis of Basic Parameters of the Suffix Tree, Mathematics and Computer Science Birkhäuser. Proceedings of a colloquium organized by TU Wien, pp.217-227, 2004.
DOI : 10.1007/978-3-0348-7915-6_22

J. Fayolle and M. D. Ward, Analysis of the average depth in a suffix tree under a markov model, International Conference on the Analysis of Algorithms, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184043

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

L. Guibas and A. M. Odlyzko, Periods in strings, Journal of Combinatorial Theory, Series A, vol.30, issue.1, pp.19-43, 1981.
DOI : 10.1016/0097-3165(81)90038-8

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

P. Jacquet and M. Régnier, Normal limiting distributions of the size of tries, Proc. Performance '87, pp.209-223, 1987.

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, Autocorrelation on words and its applications, Journal of Combinatorial Theory, Series A, vol.66, issue.2, pp.237-269, 1994.
DOI : 10.1016/0097-3165(94)90065-5
URL : https://hal.archives-ouvertes.fr/inria-00075453

P. Kirschenhofer and H. Prodinger, Further results on digital search trees, Theoretical Computer Science, vol.58, issue.1-3, pp.143-154, 1988.
DOI : 10.1016/0304-3975(88)90023-0

P. Kirschenhofer, H. Prodinger, and W. Szpankowski, On the variance of the external path length in a symmetric digital trie, Discrete Applied Mathematics, vol.25, issue.1-2, pp.129-143, 1989.
DOI : 10.1016/0166-218X(89)90050-4

S. Lonardi and W. Szpankowski, Joint source-channel LZ'77 coding, Data Compression Conference, 2003. Proceedings. DCC 2003, pp.273-282, 2003.
DOI : 10.1109/DCC.2003.1194018

M. Régnier and W. Szpankowski, On pattern frequency occurrences in a Markovian sequence, Proceedings of IEEE International Symposium on Information Theory, pp.631-649, 1998.
DOI : 10.1109/ISIT.1997.613234

W. Szpankowski, A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors, SIAM Journal on Computing, vol.22, issue.6, pp.1176-1198, 1993.
DOI : 10.1137/0222070

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

M. D. Ward, Analysis of the Multiplicity Matching Parameter in Suffix Trees, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184222

M. D. Ward and W. Szpankowski, Analysis of a randomized selection algorithm motivated by the LZ'77 scheme, 1st Workshop on Analytic Algorithmics and Combinatorics, pp.153-160, 2004.

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714