More haste, less waste: lowering the redundancy in fully indexable dictionaries
From MaRDI portal
Publication:5390004
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
Cited in
(15)- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- 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
- 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)
