Parallel RAM algorithms for factorizing words

An O(logn log log n) CRCW PRAM algorithm using O( n log n ) 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.

Authors

• J.W. Daykin
• C.S. Iliopoulos
• W.F. Smyth

Keywords

No keywords are indexed for this paper.