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.
Breaking theO(n)-barrier in the construction of compressed suffix arrays and suffix trees
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
other 1
citation-polarity summary
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
New algorithms compute shortest unique and absent substrings in O(n log σ / sqrt(log n)) time by decomposing on length and period then reducing to geometric queries via synchronizing sets, runs, and wavelet trees.
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.
-
Faster Algorithms for Shortest Unique or Absent Substrings
New algorithms compute shortest unique and absent substrings in O(n log σ / sqrt(log n)) time by decomposing on length and period then reducing to geometric queries via synchronizing sets, runs, and wavelet trees.