On compressing permutations and adaptive sorting
- 24 October 2013
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 513, 109-123
Abstract
No abstract availableKeywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Space-efficient representations of rectangle datasets supporting orthogonal range queryingInformation Systems, 2013
- LRM-Trees: Compressed indices, adaptive sorting, and compressed permutationsTheoretical Computer Science, 2012
- Succinct indexes for strings, binary relations and multilabeled treesACM Transactions on Algorithms, 2011
- Untangled monotonic chains and adaptive range searchTheoretical Computer Science, 2011
- Stronger Lempel-Ziv Based Compressed Text IndexingAlgorithmica, 2010
- Compressed representations of sequences and full-text indexesACM Transactions on Algorithms, 2007
- Approximating minimum cocoloringsInformation Processing Letters, 2002
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsJournal of Computer and System Sciences, 1994
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975