Parallel RAM algorithms for factorizing words

Authors:
J. W. Daykin;C. S. Iliopoulos;W. F. Smyth
Affiliations:
Univ. of London, The Strand London, UK;Univ. of London, The Strand, London, UK;McMaster Univ., Hamilton, Ont., Canada and Curtin Univ., Perth, Australia
Venue:
Theoretical Computer Science
Year:
1994

Citing 0
Cited 6

Lyndon-like and V-order factorizations of strings

Journal of Discrete Algorithms
Combinatorics of Unique Maximal Factorization Families (UMFFs)

Fundamenta Informaticae - Special Issue on Stringology
String comparison and Lyndon-like factorization using V-order in linear time

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Combinatorics of Unique Maximal Factorization Families (UMFFs)

Fundamenta Informaticae - Special Issue on Stringology
A linear partitioning algorithm for Hybrid Lyndons using V-order

Theoretical Computer Science
Generic algorithms for factoring strings

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract