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, alongside 10 external citations. Polarity classification is still indexing.
2
Pith papers citing it
10
external citations · OpenAlex
verdicts
CONDITIONAL 2representative citing papers
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
-
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.
-
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.