eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2009-02-19
111
122
10.4230/LIPIcs.STACS.2009.1814
article
Compressed Representations of Permutations, and Applications
Barbay, Jeremy
Navarro, Gonzalo
We explore various techniques to compress a permutation $\pi$ over $n$ integers, taking advantage of ordered subsequences in $\pi$, while supporting its application $\pi(i)$ and the application of its inverse $\pi^{-1}(i)$ in small time. Our compression schemes yield several interesting byproducts, in many cases matching, improving or extending the best existing results on applications such as the encoding of a permutation in order to support iterated applications $\pi^{k}(i)$ of it, of integer functions, and of inverted lists and suffix arrays.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol003-stacs2009/LIPIcs.STACS.2009.1814/LIPIcs.STACS.2009.1814.pdf
Compression
Permutations
Succinct data structures
Adaptive sorting