Back to Search
Start Over
Parallel RAM algorithms for factorizing words
- Source :
- Daykin, J.W., Iliopoulos, C.S. and Smyth, W.F. <
- Publication Year :
- 1994
-
Abstract
- 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.
Details
- Database :
- OAIster
- Journal :
- Daykin, J.W., Iliopoulos, C.S. and Smyth, W.F. <
- Notes :
- English
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.ocn913841361
- Document Type :
- Electronic Resource