Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Re-Pair In Small Space   Re-Pair is a grammar compression scheme with favorably good compression
rates. The computation of Re-Pair comes with the cost of maintaining large
frequency tables, which makes it hard to compute Re-Pair on large scale data
sets. As a solution for this problem we present, given a text of length $n$
whose characters are drawn from an integer alphabet, an $O(n^2) \cap O(n^2 \lg
\log_\tau n \lg \lg \lg n / \log_\tau n)$ time algorithm computing Re-Pair in
$n \lg \max(n,\tau)$ bits of space including the text space, where $\tau$ is
the number of terminals and non-terminals. The algorithm works in the restore
model, supporting the recovery of the original input in the time for the
Re-Pair computation with $O(\lg n)$ additional bits of working space. We give
variants of our solution working in parallel or in the external memory model.

18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
13
The categories of this paper are: quant-ph
19
The categories of this paper are: eess
2
The categories of this paper are: math
16
The categories of this paper are: stat
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
29
The categories of this paper are: funct-an
8
The categories of this paper are: hep-ex
28
The categories of this paper are: alg-geom