Adaptive succinctness
From MaRDI portal
Publication:6536273
DOI10.1007/978-3-030-32686-9_33zbMATH Open1539.6808MaRDI QIDQ6536273
Publication date: 19 April 2024
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient method to evaluate intersections on big data sets
- Optimal indexes for sparse bit vectors
- Compressed data structures: Dictionaries and data-aware measures
- Time-space trade-offs for predecessor search
- When indexing equals compression
- On the Redundancy of Succinct Data Structures
- On the Size of Succinct Indices
- Dynamic ordered sets with exponential search trees
- Squeezing succinct data structures into entropy bounds
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- A Data-Aware FM-index
- Practical Entropy-Compressed Rank/Select Dictionary
- Elements of Information Theory
- Run-length encodings (Corresp.)
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)
