|
Title |
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed
Permutations |
|
Authors |
Jérémy Barbay, Johannes Fischer, Gonzalo Navarro |
|
Publication date |
2012 |
|
Abstract |
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks. They have been used to encode ordinal trees and to index integer arrays in order to support range minimum queries on them. We describe how they yield many other convenient results in a variety of areas: compressed indices for range minimum queries on partially sorted arrays, a new adaptive sorting algorithm, and a compressed data structure for permutations supporting direct and inverse application in time inversely proportional to the compressibility of the permutation. |
|
Downloaded |
5 times |
|
Pages |
26-41 |
|
Volume |
459 |
|
Journal name |
Theoretical Computer Science |
|
Publisher |
Elsevier Science (Amsterdam, The Netherlands) |
|
PDF |
|
|
Reference URL |
|
