The one-way communication complexity of reporting k-edit occurrences (including the edit sequences) is Θ(n/m · k log(m|Σ|/k)) bits for 0 < k < m < n/2.
Landau and Uzi Vishkin
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative citing papers
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
-
The Communication Complexity of Pattern Matching with Edits Revisited
The one-way communication complexity of reporting k-edit occurrences (including the edit sequences) is Θ(n/m · k log(m|Σ|/k)) bits for 0 < k < m < n/2.
-
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.