1. Arroyuelo D, Cánovas R, Navarro G, Sadakane K (2010) Succinct trees in practice. In: Proceedings of 11th workshop on algorithm engineering and experiments (ALENEX), Austin. SIAM Press, pp 84–97
2. Benoit D, Demaine ED, Munro JI, Raman R, Raman V, Rao SS (2005) Representing trees of higher degree. Algorithmica 43(4):275–292
3. Chan HL, Hon WK, Lam TW, Sadakane K (2007) Compressed indexes for dynamic text collections. ACM Trans Algorithms 3(2):article 21
4. Clark DR (1996) Compact pat trees. PhD thesis, University of Waterloo
5. Denzumi S, Kawahara J, Tsuda K, Arimura H, Minato Si, Sadakane K (2014) DenseZDD: a compact and fast index for families of sets. In: Experimental algorithms (SEA), Copenhagen. LNCS 8503, pp 187–198