An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- 1 December 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (6) , 1051-1058
- https://doi.org/10.1137/0219072
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Optimal parallel algorithms for string matchingInformation and Control, 1985
- Optimal parallel pattern matching in stringsInformation and Control, 1985
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962