Fixed MSO queries admit ranked enumeration with linear preprocessing and constant delay on grammar-compressed strings.
[GNP20] Travis Gagie, Gonzalo Navarro, and Nicola Prezza
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative citing papers
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.
citing papers explorer
-
Ranked MSO-enumeration over compressed words
Fixed MSO queries admit ranked enumeration with linear preprocessing and constant delay on grammar-compressed strings.
-
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.