Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0304-3975(94)90100-7 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Parallel RAM algorithm,factorizing word | Journal | 127 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 6 |
PageRank | References | Authors |
0.66 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. W. Daykin | 1 | 7 | 1.39 |
| C. S. Iliopoulos | 2 | 52 | 6.67 |
| W. F. Smyth | 3 | 730 | 68.91 |