1. Alphabet partitioning for compressed rank/select and applications;Barbay,2010
2. Succinct indexes for strings, binary relations, and multi-labeled trees;Barbay,2007
3. Compressed representations of permutations, and applications;Barbay,2009
4. J. Barbay, G. Navarro, On compressing permutations and adaptive sorting. CoRR, 2011, abs/1108.4408.
5. Representing trees of higher degree;Benoit;Algorithmica,2005