Bounds on powers in strings

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free