Dynamic LCS maintained under edits in amortized O(log^7 n) time whp, with Omega(log n / log log n) lower bound.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Presents the first linear-time algorithm for sharing equality of lambda terms by reducing it to DAG bisimulation, improving on prior polynomial bounds.
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.
-
Sharing Equality is Linear
Presents the first linear-time algorithm for sharing equality of lambda terms by reducing it to DAG bisimulation, improving on prior polynomial bounds.