More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
From MaRDI portal
Publication:5390004
DOI10.4230/LIPIcs.STACS.2009.1847zbMath1236.68064OpenAlexW1600708628MaRDI QIDQ5390004
S. Srinivasa Rao, Roberto Grossi, Alessio Orlandi, Rajeev Raman
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4da9.html
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items
Succinct indices for path minimum, with applications, Nearly Optimal Static Las Vegas Succinct Dictionary, On the succinct representation of equivalence classes, Entropy-bounded representation of point grids, Internal shortest absent word queries in constant time and linear space, Two-dimensional range successor in optimal time and almost linear space, Efficient fully-compressed sequence representations, Fast compressed self-indexes with deterministic linear-time construction, A grouping approach for succinct dynamic dictionary matching, Range majorities and minorities in arrays, Minimal indices for predecessor search, Ranked document selection, Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
