Optimal parallel suffix-prefix matching algorithm and applications
- 1 March 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 388-398
- https://doi.org/10.1145/72935.72977
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Optimal parallel algorithms for forest and term matchingTheoretical Computer Science, 1992
- A greedy approximation algorithm for constructing shortest common superstringsTheoretical Computer Science, 1988
- Optimal parallel pattern matching in stringsInformation and Control, 1985
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- Parallel Prefix ComputationJournal of the ACM, 1980
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One DimensionSIAM Journal on Computing, 1978
- Two dimensional pattern matchingInformation Processing Letters, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974