Dynamic LCS maintained under edits in amortized O(log^7 n) time whp, with Omega(log n / log log n) lower bound.
Optimal dynamic strings
3 Pith papers cite this work, alongside 39 external citations. Polarity classification is still indexing.
3
Pith papers citing it
39
external citations · OpenAlex
fields
cs.DS 3representative citing papers
FeAVL achieves fully persistent dynamic LCE with O(log n) updates and equality, O(log n + log²ℓ) LCE w.h.p., and an AVL grammar version with O(g0 + I + U log n_max) permanent nodes.
A dynamic parallel constant-time LCE algorithm uses a string synchronizing sets hierarchy to handle updates with O(n^ε) work and enables constant-time maintenance for Dyck language membership and square detection.
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.
-
Fully Persistent Dynamic LCE via AVL Trees and AVL Grammars
FeAVL achieves fully persistent dynamic LCE with O(log n) updates and equality, O(log n + log²ℓ) LCE w.h.p., and an AVL grammar version with O(g0 + I + U log n_max) permanent nodes.
-
Longest Common Extension of a Dynamic String in Parallel Constant Time
A dynamic parallel constant-time LCE algorithm uses a string synchronizing sets hierarchy to handle updates with O(n^ε) work and enables constant-time maintenance for Dyck language membership and square detection.