Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A nearly tight memory-redundancy trade-off for one-pass compression   Let $s$ be a string of length $n$ over an alphabet of constant size $\sigma$
and let $c$ and $\epsilon$ be constants with (1 \geq c \geq 0) and (\epsilon >
0). Using (O (n)) time, (O (n^c)) bits of memory and one pass we can always
encode $s$ in (n H_k (s) + O (\sigma^k n^{1 - c + \epsilon})) bits for all
integers (k \geq 0) simultaneously. On the other hand, even with unlimited
time, using (O (n^c)) bits of memory and one pass we cannot always encode $s$
in (O (n H_k (s) + \sigma^k n^{1 - c - \epsilon})) bits for, e.g., (k = \lceil
(c + \epsilon / 2) \log_\sigma n \rceil).

19
The categories of this paper are: eess
25
The categories of this paper are: patt-sol
16
The categories of this paper are: stat
3
The categories of this paper are: physics
8
The categories of this paper are: hep-ex
34
The categories of this paper are: chem-ph
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
37
The categories of this paper are: supr-con
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
14
The categories of this paper are: math-ph