Optimal parallel pattern matching in strings
Uzi Vishkin · Springer eBooks · 1985
Cited by 154 works. doi:10.1007/bfb0015775
Authors
References
- The Design and Analysis of Computer Algorithms
- Fast Pattern Matching in Strings
- A fast string searching algorithm
- An 0(n log n) sorting network
- The equation $a^M=b^Nc^P$ in a free group.
- Sorting inc logn parallel steps
- An O(logn) parallel connectivity algorithm
- Computing connected components on parallel computers
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- The Complexity of Parallel Computations