1. David, R.: Clark. Compact Pat Trees. PhD thesis, University of Waterloo (1996)
2. Guy Jacobson. Succinct Static Data Structures. PhD thesis, Carnegie Mellon University (January 1989)
3. Miltersen, P.B.: Lower bounds on the size of selection and rank indexes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11–12 (2005)
4. Lecture Notes in Computer Science;J.I. Munro,1998
5. Munro, J.I., Raman, V., Rao, S.S.: Space efficient suffix trees. Journal of Algorithms 39(2), 205–222 (2001)