D. Arroyuelo, P. Davoodi, and S. R. Satti, Succinct dynamic cardinal trees, Algorithmica, vol.74, issue.2, pp.742-777, 2016.

D. Arroyuelo and G. Navarro, Space-efficient construction of Lempel-Ziv compressed text indexes, Information and Computation, vol.209, issue.7, pp.1070-1102, 2011.

D. Arroyuelo, G. Navarro, and K. Sadakane, Stronger Lempel-Ziv based compressed text indexing, Algorithmica, vol.62, issue.1, pp.54-101, 2012.

D. R. Clark, Compact PAT Trees, Canada, 1996.

H. Ferrada and G. Navarro, A Lempel-Ziv compressed structure for document listing, Proc. 20th International Symposium on String Processing and Information Retrieval (SPIRE), vol.8214, pp.116-128, 2013.

H. Ferrada and G. Navarro, Efficient compressed indexing for approximate top-k string retrieval, Proc. 21st International Symposium on String Processing and Information Retrieval (SPIRE). pp, vol.8799, pp.18-30, 2014.

P. Ferragina and G. Manzini, Indexing compressed texts, Journal of the ACM, vol.52, issue.4, pp.552-581, 2005.

J. Fischer, I. , T. Köppl, and D. , Lempel Ziv computation in small space (LZ-CISS), Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM), vol.9133, pp.172-184, 2015.

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 2008.

J. Jansson, K. Sadakane, and W. Sung, Linked dynamic tries with applications to LZ-compression in sublinear time and space, Algorithmica, vol.71, issue.4, pp.969-988, 2015.

D. Köppl and K. Sadakane, Lempel-Ziv computation in compressed space (LZ-CICS), Proc. 26th Data Compression Conference, pp.3-12, 2016.

A. Pagh, R. Pagh, and M. Ruzic, Linear probing with 5-wise independence, SIAM Review, vol.53, issue.3, pp.547-558, 2011.

M. Patrascu and M. Thorup, On the k-independence required by linear probing and minwise independence, ACM Transactions on Algorithms, vol.12, issue.1, 2016.

A. Poyias, S. J. Puglisi, and R. Raman, m-Bonsai: a practical compact dynamic trie, Preliminary version Proc. SPIRE'15, vol.9309, 2017.

L. M. Russo and A. L. Oliveira, A compressed self-index using a Ziv-Lempel dictionary, Information Retrieval, vol.11, issue.4, pp.359-388, 2008.

K. Sadakane and R. Grossi, Squeezing succinct data structures into entropy bounds, Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1230-1239, 2006.

T. A. Welch, A technique for high performance data compression, IEEE Computer, vol.17, issue.6, pp.8-19, 1984.

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.

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