An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Theoretical Computer Science
Applications of an infinite square-free co-CFL
Theoretical Computer Science
Efficient string algorithmics
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Handbook of formal languages, vol. 1
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
Performance of a Comprehensive and Efficient Constraint Library Based on Local Search
AI '98 Selected papers from the 11th Australian Joint Conference on Artificial Intelligence on Advanced Topics in Artificial Intelligence
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics
| Hi-index | 0.00 |
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient algorithm to solve this problem for strings over arbitrarily ordered alphabets. Its running time is O(n log n), where n is the ending position of the first square, which matches the running times of the fastest known algorithms for the analogous offline problem. We also present a very simple algorithm for a dynamic version of the problem over general alphabets in which we are initially given a squarefree string, followed by a series of updates, and the objective is to determine after each update if the resulting string contains a square and if so, report it and stop.