Dynamic LCS maintained under edits in amortized O(log^7 n) time whp, with Omega(log n / log log n) lower bound.
Iliopoulos, Tomasz Kociumaka, Solon P
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 2roles
background 1polarities
background 1representative 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
-
Dynamic Longest Common Substring in Polylogarithmic Time
Dynamic LCS maintained under edits in amortized O(log^7 n) time whp, with Omega(log n / log log n) lower bound.
-
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.