2026-07-22T20:50:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1814 2024-03-06T10:33:08Z ddc:004 open_access

Compressed Representations of Permutations, and Applications Barbay, Jeremy Navarro, Gonzalo Compression Permutations Succinct data structures Adaptive sorting 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jeremy Barbay and Gonzalo Navarro 2009 Is Part Of LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2009.1814 urn:nbn:de:0030-drops-18148 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1814 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode