Fast parallel Lyndon factorization with applications
Authors:
- 1 March 1995
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 28 (2) , 89-108
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Optimal canonization of all substrings of a stringInformation and Computation, 1991
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arraysTheoretical Computer Science, 1991
- Two-way string-matchingJournal of the ACM, 1991
- Efficient Parallel Algorithms for String Editing and Related ProblemsSIAM Journal on Computing, 1990
- Optimal bounds for decision problems on the CRCW PRAMJournal of the ACM, 1989
- Highly parallelizable problems1989
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- An improved algorithm to check for polygon similarityInformation Processing Letters, 1978
- Free Differential Calculus, IV. The Quotient Groups of the Lower Central SeriesAnnals of Mathematics, 1958