Adaptive succinctness
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3960768
- Adaptive Heuristics
- Axioms of adaptivity
- scientific article; zbMATH DE number 2084332
- Adaptive cascade
- scientific article; zbMATH DE number 1303671
- scientific article; zbMATH DE number 760183
- Sensitivity, robustness and efficiency of adaptation
- The adaptive logic of compatibility
Cites work
- A Data-Aware FM-index
- A walk through combinatorics. An introduction to enumeration and graph theory. With a foreword by Richard Stanley
- An efficient method to evaluate intersections on big data sets
- Cell-probe lower bounds for succinct partial sums
- Codes for the World Wide Web
- Compact dictionaries for variable-length keys and data with applications
- Compressed data structures: Dictionaries and data-aware measures
- Computational geometry. Algorithms and applications.
- Dictionaries using variable-length keys and data, with applications
- Dynamic ordered sets with exponential search trees
- Efficient Storage and Retrieval by Content and Address of Static Files
- Elements of Information Theory
- Engineering the LOUDS Succinct Tree Representation
- From time to space: fast algorithms that yield small and fast data structures
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- scientific article; zbMATH DE number 1445373 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- Huffman coding in bit-vector compression
- Introduction to algorithms.
- On the Redundancy of Succinct Data Structures
- On the Size of Succinct Indices
- Optimal indexes for sparse bit vectors
- 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
- Ultra-succinct representation of ordered trees with applications
- When indexing equals compression, experiments with compressing suffix arrays and applications
Cited in
(9)- Rank and select operations on a word
- On the Redundancy of Succinct Data Structures
- Optimal succinct rank data structure via approximate nonnegative tensor decomposition
- Practical entropy-compressed rank/select dictionary
- Compressed Prefix Sums
- Experimental and Efficient Algorithms
- On representing the degree sequences of sublogarithmic-degree Wheeler graphs
- Adaptive succinctness
- \textsc{Concise}: compressed `\(n\)' composable integer set
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 Q2118203)
