COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS
From MaRDI portal
Publication:5389970
DOI10.4230/LIPIcs.STACS.2009.1814zbMath1236.68063MaRDI QIDQ5389970
Jérémy Barbay, Gonzalo Navarro
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_a7d4.html
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68P05: Data structures
Related Items
Unnamed Item, Fast construction of wavelet trees, Compact binary relation representations with rich functionality, On compressing permutations and adaptive sorting, New algorithms on wavelet trees and applications to information retrieval, Succinct representations of permutations and functions, Efficient fully-compressed sequence representations, LRM-trees: compressed indices, adaptive sorting, and compressed permutations, Wavelet trees for all, New techniques and tighter bounds for local computation algorithms, From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures, LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations