D. Aldous and P. Shields, A Diffusion Limit for a Class of Random-Growing Binary Trees, Probab. Th. Rel. Fields, vol.79, pp.509-542, 1988.

T. M. Cover and J. A. Thomas, Elements of Information Theory, 2006.
DOI : 10.1002/047174882x

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

P. Jacquet, P. , M. Régnier, and M. , Normal limiting distribution of the size of tries, Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation, pp.209-223, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00075724

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, pp.161-197, 1995.
DOI : 10.1016/0304-3975(94)00298-w
URL : https://doi.org/10.1016/0304-3975(94)00298-w

P. Jacquet and W. Szpankowski, Analytical depoissonization and its applications, Theoretical Computer Science, vol.201, issue.1, pp.1-62, 1998.
DOI : 10.1016/s0304-3975(97)00167-9
URL : https://doi.org/10.1016/s0304-3975(97)00167-9

P. Jacquet and W. Szpankowski, On the Limiting Distribution of Lempel Ziv'78 Redundancy for Memoryless Sources, IEEE Trans. Information Theory, vol.60, pp.6917-6930, 2014.

P. Jacquet, W. Szpankowski, and J. Tang, Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source, Algorithmica, 2002.

P. Jacquet and W. Szpankowski, Analytic Pattern Matching: From DNA to Twitter, 2015.
DOI : 10.1017/cbo9780511843204

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

K. Leckey, R. Neininger, and N. Wormald, Probabilistic Analysis of Lempel-Ziv Parsing for Markov Sources, 2017.

K. Leckey, R. Neininger, and W. Szpankowski, Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model, SIAMACM Symposium on Discrete Algorithms (SODA 2013, pp.877-886, 2013.

G. Louchard and . Szpankowski, On the average redundancy rate of the Lempel-Ziv code, IEEE Transactions on Information Theory, vol.43, pp.2-8, 1997.

R. Neininger and L. Rüschendorf, A General Limit Theorem for Recursive Algorithms and Combinatorial Structures, The Annals of Applied Probability, vol.14, issue.1, pp.378-418, 2004.

S. Savari, Redundancy of the Lempel-Ziv Incremental Parsing Rule, IEEE Trans. Information Theory, vol.43, pp.9-21, 1997.

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

P. Shields, The Ergodic Theory of Discrete Sample Paths, 1996.

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.

J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, vol.24, pp.530-536, 1978.