1. Representing trees of higher degree;Benoit;Algorithmica,2005
2. Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values;Berkman;J. Algorithms,1993
3. Practical compressed suffix trees;Cánovas,2010
4. A. Farzan, Succinct representation of trees and graphs, PhD Thesis, University of Waterloo, Canada, 2009. Available at https://uwspace.uwaterloo.ca/bitstream/10012/4832/1/main.pdf.
5. A uniform approach towards succinct representation of trees;Farzan,2008