Parallel computations on strings and arrays
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 109-125
- https://doi.org/10.1007/3-540-52282-4_36
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Optimal parallel algorithms for string matchingInformation and Control, 1985
- Optimal parallel pattern matching in stringsInformation and Control, 1985
- Open Problems in StringologyPublished by Springer Nature ,1985
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- A Linear-Time On-Line Recognition Algorithm for ``Palstar''Journal of the ACM, 1978
- Two dimensional pattern matchingInformation Processing Letters, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a StringJournal of the ACM, 1975