Bounds on powers in strings

Maxime Crochemore; Szilárd Zsolt Fazekas; Costas Iliopoulos; Inuka Jayasekera

Conference Proceedings

Bounds on powers in strings

Crochemore M
Fazekas S
Iliopoulos C
et al.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5257 LNCS 206-215

DOI: 10.1007/978-3-540-85780-8_16

6Citations

2Readers

Get full text

Abstract

We show a Θ(n logn) 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 show a Θ(n 2) bound on the maximal number of primitively-rooted powers with fractional exponent e, 1

Cite

CITATION STYLE

APA

Crochemore, M., Fazekas, S. Z., Iliopoulos, C., & Jayasekera, I. (2008). Bounds on powers in strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5257 LNCS, pp. 206–215). https://doi.org/10.1007/978-3-540-85780-8_16

Bounds on powers in strings

Abstract

Cite

Register to see more suggestions