A general space-query time trade-off for random access on grammar-compressed strings that is tight in almost all regimes, with an unconditional matching lower bound.
[Lar12] Kasper Green Larsen
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes
A general space-query time trade-off for random access on grammar-compressed strings that is tight in almost all regimes, with an unconditional matching lower bound.