1. Improved behaviour of tries by adaptive branching;Andersson;Inform. Process. Lett.,1993
2. A. Andersson, S. Nilsson, Faster searching in tries and quadtries—an analysis of level compression, in: Proc. 2nd Annual European Symp. on Algorithms, 1994, pp. 82–93
3. J. Clement, P. Flajolet, B. Vallée, The analysis of hybrid trie structures, in: Proc. Annual ACM–SIAM Symp. on Discrete Algorithms, San Francisco, CA, 1998, pp. 531–539
4. Elements of Information Theory;Cover,1991
5. A note on the average depths in tries;Devroye;SIAM J. Comput.,1982