License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1814
URN: urn:nbn:de:0030-drops-18148
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1814/
Barbay, Jeremy ; Navarro, Gonzalo

Compressed Representations of Permutations, and Applications

pdf-format:
Dokument 1.pdf (191 KB)

Abstract

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.

BibTeX - Entry

@InProceedings{barbay_et_al:LIPIcs:2009:1814,
  author =	{Jeremy Barbay and Gonzalo Navarro},
  title =	{Compressed Representations of Permutations, and Applications},
  booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)},
  pages =	{111--122},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-09-05},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{3},
  editor =	{Susanne Albers and Jean-Yves Marion},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1814},
  URN =		{urn:nbn:de:0030-drops-18148},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1814},
  annote =	{Keywords: Compression, Permutations, Succinct data structures, Adaptive sorting}
}

Keywords: Compression, Permutations, Succinct data structures, Adaptive sorting
Seminar: 26th International Symposium on Theoretical Aspects of Computer Science
Issue date: 2009
Date of publication: 19.02.2009

DROPS-Home | Fulltext Search | Imprint Published by LZI