More haste, less waste: lowering the redundancy in fully indexable dictionaries

DOI10.4230/LIPICS.STACS.2009.1847zbMATH Open1236.68064OpenAlexW1600708628MaRDI QIDQ5390004FDOQ5390004

Authors: Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao 

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4da9.html

Recommendations

• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Optimal indexes for sparse bit vectors
• Efficient fully-compressed sequence representations
• Compressed data structures: Dictionaries and data-aware measures

zbMATH Keywords

data structurecompressionfully indexable dictionary (FID)

Mathematics Subject Classification ID

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

Cited In (15)

• Fast compressed self-indexes with deterministic linear-time construction
• Succinct indices for path minimum, with applications
• Efficient fully-compressed sequence representations
• On the succinct representation of equivalence classes
• Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
• Two-dimensional range successor in optimal time and almost linear space
• Ranked document selection
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Internal shortest absent word queries in constant time and linear space
• Minimal indices for predecessor search
• Range majorities and minorities in arrays
• A grouping approach for succinct dynamic dictionary matching
• Nearly Optimal Static Las Vegas Succinct Dictionary
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Entropy-bounded representation of point grids

This page was built for publication: More haste, less waste: lowering the redundancy in fully indexable dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390004)