Dynamic LCS maintained under edits in amortized O(log^7 n) time whp, with Omega(log n / log log n) lower bound.
Thankachan , BookTitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Constructs infinite 3⁺-parameterized-square-free ternary words and 3⁺-order-preserving-square-free binary words via morphic substitutions, plus reports longest finite ℓ⁺-square-free words under several equivalences.
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.