Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- 1 September 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 88 (1) , 59-82
- https://doi.org/10.1016/0304-3975(91)90073-b
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Transducers and repetitionsTheoretical Computer Science, 1986
- 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
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- 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