We present a linear-time algorithm computing all full Abelian periods of a word.
We show fast randomized and deterministic algorithms computing all Abelian periods.
We obtain O(1)-time GCD queries with arguments at most n with O(n) preprocessing time.