A. Andersson, T. Hagerup, J. Håstad, and O. Petersson, Tight Bounds for Searching a Sorted Array of Strings, SIAM J. Comput, vol.30, issue.5, pp.1552-1578, 2000.

A. Apostolico, M. Crochemore, M. Farach-colton, Z. Galil, and S. Muthukrishnan, 40 Years of Suffix Trees, Commun. ACM, vol.59, issue.4, pp.66-73, 2016.

W. Bosma, K. Dajani, and C. Kraaikamp, Entropy quotients and correct digits in number-theoretic expansions, Dynamics & stochastics, vol.48, pp.176-188, 2006.

J. Clément, J. A. Fill, T. Hien-nguyen, T. , and B. Vallée, Towards a Realistic Analysis of the QuickSelect Algorithm, Theory of Computing Systems, vol.58, pp.528-578, 2016.

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

J. Clément, T. Nguyen-thi, and B. Vallée, Towards a Realistic Analysis of Some Popular Sorting Algorithms, Combinatorics, Probability and Computing, vol.24, issue.1, pp.104-144, 2015.

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00470109

K. Dajani and A. Fieldsteel, Equipartition of interval partitions and an application to number theory, Proc. Amer. Math. Soc, vol.129, issue.12, pp.3453-3460, 2001.

L. Devroye, A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort, Acta Inf, vol.21, issue.3, pp.229-237, 1984.

J. Fischer, Inducing the LCP-Array, Frank Dehne, John Iacono, and Jörg-Rüdiger Sack, pp.374-385, 2011.
DOI : 10.1007/978-3-642-22300-6_32

G. Franceschini and R. Grossi, No Sorting? Better Searching! In 45th Symposium on Foundations of Computer Science (FOCS, pp.491-498, 2004.

S. Gog and E. Ohlebusch, Fast and Lightweight LCP-array Construction Algorithms, Proceedings of the Meeting on Algorithm Engineering & Expermiments, ALENEX '11, pp.25-34, 2011.
DOI : 10.1137/1.9781611972917.3