Dynamic longest common substring in polylogarithmic time
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 6850408 (Why is no real title available?)
- scientific article; zbMATH DE number 1445383 (Why is no real title available?)
- A data structure for multi-dimensional range reporting
- Adding range restriction capability to dynamic data structures
- Dictionary matching and indexing with errors and don't cares
- Dynamic text and static pattern matching
- Faster fully compressed pattern matching by recompression
- Linear-time algorithm for long LCF with k mismatches
- Locally maximal common factors as a tool for efficient dynamic string algorithms
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Logarithmic Lower Bounds in the Cell-Probe Model
- Longest common extensions with recompression
- Longest common factor after one edit operation
- Longest common substring made fully dynamic
- Longest common substring with approximately \(k\) mismatches
- Recompression: a simple and powerful technique for word equations
- Repetition Detection in a Dynamic String
- Sublinear space algorithms for the longest common substring problem
- The heaviest induced ancestors problem revisited
- Time-space trade-offs for predecessor search
- Time-space trade-offs for the longest common substring problem
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
- Unifying the landscape of cell-probe lower bounds
This page was built for publication: Dynamic longest common substring in polylogarithmic time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842550)
