Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Power of Simple Tabulation Hashing   Randomized algorithms are often enjoyed for their simplicity, but the hash
functions used to yield the desired theoretical guarantees are often neither
simple nor practical. Here we show that the simplest possible tabulation
hashing provides unexpectedly strong guarantees.
  The scheme itself dates back to Carter and Wegman (STOC'77). Keys are viewed
as consisting of c characters. We initialize c tables T_1, ..., T_c mapping
characters to random hash codes. A key x=(x_1, ..., x_q) is hashed to T_1[x_1]
xor ... xor T_c[x_c].
  While this scheme is not even 4-independent, we show that it provides many of
the guarantees that are normally obtained via higher independence, e.g.,
Chernoff-type concentration, min-wise hashing for estimating set intersection,
and cuckoo hashing.

11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
26
The categories of this paper are: bayes-an
3
The categories of this paper are: physics
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
2
The categories of this paper are: math
6
The categories of this paper are: astro-ph
31
The categories of this paper are: ao-sci
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
33
The categories of this paper are: plasm-ph
20
The categories of this paper are: acc-phys