An efficient parallel algorithm for the single function coarsest partition problem
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Lyndon-like and V-order factorizations of strings
Journal of Discrete Algorithms
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial 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
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
A linear partitioning algorithm for Hybrid Lyndons using V-order
Theoretical Computer Science
Generic algorithms for factoring strings
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |