Adaptive succinctness
From MaRDI portal
Publication:6536273
Recommendations
Cites work
- A Data-Aware FM-index
- An efficient method to evaluate intersections on big data sets
- Cell-probe lower bounds for succinct partial sums
- Compressed data structures: Dictionaries and data-aware measures
- Computational geometry. Algorithms and applications.
- Dynamic ordered sets with exponential search trees
- Elements of Information Theory
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 6850405 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- On the Redundancy of Succinct Data Structures
- On the Size of Succinct Indices
- Optimal indexes for sparse bit vectors
- Practical entropy-compressed rank/select dictionary
- Run-length encodings (Corresp.)
- Squeezing succinct data structures into entropy bounds
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Time-space trade-offs for predecessor search
- When indexing equals compression, experiments with compressing suffix arrays and applications
This page was built for publication: Adaptive succinctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536273)