Abstract

Abstract. We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the application of its inverse π −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 π k (i) of it, of integer functions, and of inverted lists and suffix arrays. 1.

Citations

1926	Modern Information Retrieval - Baeza-Yates, Ribeiro-Neto - 1999
772	A method for the construction of minimum-redundancy codes - Huffman - 1952
605	The art of computer programming, volume 3: Sorting and searching - Knuth - 1973
334	Self-adjusting binary search trees - SLEATOR, E - 1985
172	Compressed suffix arrays and suffix trees with applications to text indexing and string matching - GROSSI, S
163	High-order entropy-compressed text indexes - Grossi, Gupta, et al. - 2003
162	Managing Gigabytes - Witten, Moffat, et al. - 1999
149	S: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets - Raman, Raman, et al.
142	Compressed full text indexes - Navarro, Mäkinen
114	An analysis of the Burrows-Wheeler transform - Manzini
111	Information Retrieval: Computational and Theoretical Aspects - Heaps - 1978
92	G.: Compressed representations of sequences and full-text indexes - Ferragina, Manzini, et al. - 2010
77	New text indexing functionalities of the compressed suffix arrays - Sadakane
74	Fast and flexible word searching on compressed text - Moura, Navarro, et al. - 2000
73	Compact pat trees - Clark - 1996
55	A survey of adaptive sorting algorithms - Estivill-Castro, Wood - 1992
53	A new representation of linear lists - Guibas, McCreight, et al. - 1977
46	An Almost Optimal Algorithm for Unbounded Searching - BENTLEY, YAO - 1976
46	Succinct suffix arrays based on run-length encoding - MÄKINEN, G
43	Rank/select operations on large alphabets: a tool for text indexing - Golynski, Munro, et al. - 2006
39	On computing the length of longest increasing subsequences - Fredman
33	S.S.: Succinct representations of permutations - Munro, Raman, et al. - 2003
30	A fast set intersection algorithm for sorted sequences - Baeza-Yates - 2004
30	Succinct indexes for strings, binary relations and multi-labeled trees - Barbay, He, et al. - 2007
29	Rank and select revisited and extended - Mäkinen, Navarro - 2007
27	Optimal lower bounds for rank and select indexes - Golynski
26	Ultra-succinct representation of ordered trees - Jansson, Sadakane, et al. - 2007
25	Practical rank/select queries over arbitrary sequences - Claude, Navarro - 2008
23	G.: Implicit compression boosting with applications to selfindexing - Mäkinen, Navarro - 2007
23	Measures of presortedness and optimal sorting algorithms - Mannila - 1985
22	K.: Reducing the space requirement of LZ-index - Arroyuelo, Navarro, et al. - 2006
22	T.: Faster adaptive set intersections for text searching - Barbay, López-Ortiz, et al. - 2006
21	Adaptive searching in succinctly encoded binary relations and tree-structured documents - Barbay, Golynski, et al.
16	Compact set representation for information retrieval - Culpepper, Moffat - 2007
16	Intersection in integer inverted indices - Sanders, Transier - 2007
15	Succinct representations of functions - Munro, Rao - 2004
12	Compressed representations of permutations, and applications - Barbay, Navarro - 2009
12	Reorganizing compressed text - Brisaboa, Fariña, et al. - 2008
12	Run-length compressed indexes are superior for highly repetitive sequence collections - Sirén, Välimäki, et al. - 2008
11	Optimal computer-search trees and variable-length alphabetic codes - Hu, Tucker - 1971
10	Partitioning permutations into increasing and decreasing subsequences - Kézdy, Snevily, et al. - 1996
7	Best sorting algorithm for nearly sorted lists - Cool, Kim - 1980
7	Sorting shuffled monotone sequences - Levcopoulos, Petersson - 1994
7	Sorting presorted files - Mehlhorn - 1979
5	Encroaching lists as a measure of presortedness - Skiena - 1988