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
fields
cs.DS 2representative citing papers
A Fiat-Naor-based inversion technique yields data structures for range searching, counting, and related queries on implicit sets f([N]) with ~O(N^{1-α/3}) space and ~O(N^α) query time for any α ∈ (0,1).
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.
-
A General Technique for Searching in Implicit Sets via Function Inversion
A Fiat-Naor-based inversion technique yields data structures for range searching, counting, and related queries on implicit sets f([N]) with ~O(N^{1-α/3}) space and ~O(N^α) query time for any α ∈ (0,1).