Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Linear Hashing is Awesome   We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$
are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we
use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size
$n$ the expected length of the longest chain is
$\tilde{O}\!\left(n^{1/3}\right)$. The proof also generalises to give the same
bound when we use the multiply-shift hash function by Dietzfelbinger et al.
[Journal of Algorithms 1997].

37
The categories of this paper are: supr-con
4
The categories of this paper are: cond-mat
9
The categories of this paper are: nlin
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn
16
The categories of this paper are: stat
19
The categories of this paper are: eess
24
The categories of this paper are: dg-ga
6
The categories of this paper are: astro-ph
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int
3
The categories of this paper are: physics
20
The categories of this paper are: acc-phys
10
The categories of this paper are: q-bio
18
The categories of this paper are: econ