Computing String Covers in Sublinear Time

Jakub Radoszewski, Wiktor Zuba

Let $T$ be a string of length $n$ over an integer alphabet of size $\sigma$. In the word RAM model, $T$ can be represented in $O(n/{\log }_{\sigma }n)$ space. We show that a representation of all…