A bidirectional reduction between suffix random access and function inversion enables improved asymmetric streaming algorithms for exact/approximate pattern matching and relative Lempel-Ziv compression.
Faster Online Elastic Degenerate String Matching
3 Pith papers cite this work, alongside 15 external citations. Polarity classification is still indexing.
3
Pith papers citing it
15
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
GD string matching admits a classical Õ(N√m) algorithm, and combinatorial GD/ED indices cannot improve the known m-dependence under the k-clique conjecture.
It gives an explicit infinite ternary word with no parameterized squares of half-length at least 3 and an explicit infinite binary word with no order-preserving squares of half-length at least 3, plus finite extremal lengths.
citing papers explorer
-
Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms
A bidirectional reduction between suffix random access and function inversion enables improved asymmetric streaming algorithms for exact/approximate pattern matching and relative Lempel-Ziv compression.
-
Algorithms and Indexing Lower Bounds for Variable String Matching
GD string matching admits a classical Õ(N√m) algorithm, and combinatorial GD/ED indices cannot improve the known m-dependence under the k-clique conjecture.
-
Relaxation of Square-Freeness
It gives an explicit infinite ternary word with no parameterized squares of half-length at least 3 and an explicit infinite binary word with no order-preserving squares of half-length at least 3, plus finite extremal lengths.