eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2013-02-26
245
256
10.4230/LIPIcs.STACS.2013.245
article
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
Kociumaka, Tomasz
Radoszewski, Jakub
Rytter, Wojciech
We present efficient algorithms computing all Abelian periods of two types in a word. Regular Abelian periods are computed in O(n log log{n}) randomized time which improves over the best previously known algorithm by almost a factor of n. The other algorithm, for full Abelian periods, works in O(n) time. As a tool we develop an O(n) time construction of a data structure that allows O(1) time gcd(i,j) queries for all 1 <= i,j <= n, this is a result of independent interest.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol020-stacs2013/LIPIcs.STACS.2013.245/LIPIcs.STACS.2013.245.pdf
Abelian period
greatest common divisor