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.
Optimal deterministic approximate parallel prefix sums and their applications
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
citing papers explorer
-
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.
- Work-Efficient Query Evaluation in Constant Time with PRAMs