@inproceedings{1859975dffcf4f5cae8ced280e79d86e,

title = "On the complexity of determining the period of a string",

abstract = "We study the complexity of a classical combinatorial problem of computing the period of a string.We investigate both the average- and the worst-case complexity of the problem. We deliver almost tight bounds for the average-case. We show that every algorithm computing the period must examine (formula presented) symbols of an input string of lengthm. On the other hand we present an algorithm that computes the period by examining on average (formula presented) symbols, where |Σ| ³ 2 stands for the input alphabet. We also present a deterministic algorithm that computes the period of a string usingm+O(m3/4) comparisons. This is the first algorithm that have the worstcase complexity m + o(m)",

author = "Artur Czumaj and Leszek Ga{\c s}ieniec",

year = "2000",

month = jan,

day = "1",

doi = "10.1007/3-540-45123-4_34",

language = "English (US)",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "412--422",

editor = "Raffaele Giancarlo and David Sankoff",

booktitle = "Combinatorial Pattern Matching - 11th Annual Symposium, CPM 2000, Proceedings",

note = "11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000 ; Conference date: 21-06-2000 Through 23-06-2000",

}