Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Update Query Time Trade-off for dynamic Suffix Arrays   The Suffix Array SA(S) of a string S[1 ... n] is an array containing all the
suffixes of S sorted by lexicographic order. The suffix array is one of the
most well known indexing data structures, and it functions as a key tool in
many string algorithms. In this paper, we present a data structure for
maintaining the Suffix Array of a dynamic string. For every $0 \leq \varepsilon
\leq 1$, our data structure reports SA[i] in $\tilde{O}(n^{\varepsilon})$ time
and handles text modification in $\tilde{O}(n^{1-\varepsilon})$ time.
Additionally, our data structure enables the same query time for reporting
iSA[i], with iSA being the Inverse Suffix Array of S[1 ... n]. Our data
structure can be used to construct sub-linear dynamic variants of static
strings algorithms or data structures that are based on the Suffix Array and
the Inverse Suffix Array.

36
The categories of this paper are: cmp-lg
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
4
The categories of this paper are: cond-mat
15
The categories of this paper are: nucl-ex
20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg