A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Parallel RAM algorithms for factorizing words
1994
Theoretical Computer Science
An O(logn loglogn) CRCW PRAM algorithm using O(n/logn) processors for computing the unique Lyndon factorization of a word of length n over an unbounded alphabet is presented; this improves the bounds given by Apostolico and Crochemore (1989) . Moreover, in the case of fixed alphabets the CRCW PRAM algorithm is optimal (linear cost), requiring O(log n) units of time.
doi:10.1016/0304-3975(94)90100-7
fatcat:7g75xz75xfeiblqk7mtqylv3by