1. Lecture Notes in Computer Science;J. Barbay,2010
2. Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proc. 18th SODA, pp. 680–689 (2007)
3. Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: Proc. 26th STACS, pp. 111–122 (2009)
4. Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: searching a sorted table with o(1) accesses. In: Proc. 20th SODA, pp. 785–794 (2009)
5. Belazzougui, D., Navarro, G.: New lower and upper bounds for representing sequences. CoRR, arXiv:1111.26211v1 (2011)
http://arxiv.org/abs/1111.2621v1