1. Ian Munro J, Raman R, Raman V, Srinivasa Rao S (2012) Succinct representations of permutations and functions. Theorical Computer Science (TCS) 438:74–88
2. Barbay J, Navarro G (2013) On compressing permutations and adaptive sorting. Theorical Computer Science (TCS) 513:109–123
3. Barbay J, Fischer J, Navarro G (2012) LRM-trees: compressed indices, adaptive sorting, and compressed permutations. Theorical Computer Science (TCS) 459:26–41
4. Barbay J (2013) From time to space: fast algorithms that yield small and fast data structures. In: Brodnik A, López-Ortiz A, Raman V, Viola A (eds) Space-efficient data structures, streams, and algorithms (IanFest). Volume 8066 of Lecture Notes in Computer Science. Springer, Heidelberg, pp 97–111
5. Ian Munro J, Raman V (1997) Succinct representation of balanced parentheses, static trees and planar graphs. In: IEEE symposium on Foundations Of Computer Science, Miami Beach, pp 118–126