1. David R. Clark, Compact pat trees, Ph.D. Thesis, University of Waterloo, 1996
2. Guy Jacobson, Succinct static data structures, Ph.D. Thesis, Carnegie Mellon University, January 1989
3. Peter Bro Miltersen, Lower bounds on the size of selection and rank indexes, in: Proceedings of the 16th Annual ACM–SIAM Symposium on Discrete Algorithms, 2005, pp. 11–12
4. Space efficient suffix trees;Ian Munro,1998
5. Space efficient suffix trees;Ian Munro;Journal of Algorithms,2001