Parallel RAM algorithms for factorizing words

J.W. Daykin, C.S. Iliopoulos, W.F. Smyth
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