COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS

DOI10.4230/LIPIcs.STACS.2009.1814zbMath1236.68063OpenAlexW1481520974MaRDI 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

zbMATH Keywords

permutationscompressionsuccinct data structuresadaptive sorting

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (12)

Fast construction of wavelet trees ⋮ New techniques and tighter bounds for local computation algorithms ⋮ Compact binary relation representations with rich functionality ⋮ On compressing permutations and adaptive sorting ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Unnamed Item ⋮ Succinct representations of permutations and functions ⋮ Wavelet trees for all ⋮ Efficient fully-compressed sequence representations ⋮ LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋮ LRM-trees: compressed indices, adaptive sorting, and compressed permutations ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures

This page was built for publication: COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS