Parallel RAM algorithms for factorizing words

An O(log n 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 P...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 127; no. 1; pp. 53 - 67
Main Authors Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 09.05.1994
Elsevier
Subjects
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Free monoid
Parallelism
Parallel algorithm
Complexity analysis
Language theory
Online AccessGet full text
ISSN0304-3975
1879-2294
DOI10.1016/0304-3975(94)90100-7

Cover

More Information
Summary:An O(log n 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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(94)90100-7