Achieving Optimal Redundancy for Small Dynamic Rank/Select Dictionaries
cs.DS
Submitted: 2026-10-01
Updated: 2026-11-01
Terminology
Sources
- Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
- Succinct Dynamic Ordered Sets with Random Access
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles