Index Terms
- An O(n log n) algorithm for finding all repetitions in a string
Recommendations
An Optimal O(log log n)-Time Parallel Algorithm for Detecting all Squares in a String
An optimal $O(\log\log n)$-time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets, this is the fastest possible optimal algorithm. When $p$ ...
Factorizing Strings into Repetitions
AbstractA factorization f1,…,fm of a string w is called a repetition factorization of w if each factor fi is a repetition, namely, for some non-empty string x, an integer k ≥ 2, and being a proper prefix of x. Dumitran et al. (Proc. SPIRE 2015) ...
Comments