Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Algorithms for Computing Abelian Periods of Words   Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the
notion of an \emph{Abelian period} of a word. A word of length $n$ over an
alphabet of size $\sigma$ can have $\Theta(n^{2})$ distinct Abelian periods.
The Brute-Force algorithm computes all the Abelian periods of a word in time
$O(n^2 \times \sigma)$ using $O(n \times \sigma)$ space. We present an off-line
algorithm based on a $\sel$ function having the same worst-case theoretical
complexity as the Brute-Force one, but outperforming it in practice. We then
present on-line algorithms that also enable to compute all the Abelian periods
of all the prefixes of $w$.

36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th