Optimal parallel pattern matching in strings
- 31 December 1985
- journal article
- Published by Elsevier in Information and Control
- Vol. 67 (1-3) , 91-113
- https://doi.org/10.1016/s0019-9958(85)80028-0
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- On efficient parallel strong orientationInformation Processing Letters, 1985
- Optimal parallel generation of a computation tree formACM Transactions on Programming Languages and Systems, 1985
- An optimal parallel connectivity algorithmDiscrete Applied Mathematics, 1984
- An optimal algorithm for parallel selectionInformation Processing Letters, 1984
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Computing connected components on parallel computersCommunications of the ACM, 1979
- A fast string searching algorithmCommunications of the ACM, 1977
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962