Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Invertible Bloom Lookup Tables   We present a version of the Bloom filter data structure that supports not
only the insertion, deletion, and lookup of key-value pairs, but also allows a
complete listing of its contents with high probability, as long the number of
key-value pairs is below a designed threshold. Our structure allows the number
of key-value pairs to greatly exceed this threshold during normal operation.
Exceeding the threshold simply temporarily prevents content listing and reduces
the probability of a successful lookup. If later entries are deleted to return
the structure below the threshold, everything again functions appropriately. We
also show that simple variations of our structure are robust to certain
standard errors, such as the deletion of a key without a corresponding
insertion or the insertion of two distinct values for a key. The properties of
our structure make it suitable for several applications, including database and
networking applications that we highlight.

18
The categories of this paper are: econ
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
6
The categories of this paper are: astro-ph
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
25
The categories of this paper are: patt-sol
27
The categories of this paper are: comp-gas
4
The categories of this paper are: cond-mat
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
14
The categories of this paper are: math-ph
13
The categories of this paper are: quant-ph