IJFCS
2010
13 years 3 months ago
2010
Abstract. We show a Θ(n log n) bound on the maximal number of occurrences of primitively-rooted k-th powers occurring in a string of length n for any integer k, k ≥ 2. We also s...
JCSS
2008
13 years 5 months ago
2008
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...