Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Further Unifying the Landscape of Cell Probe Lower Bounds   In a landmark paper, P\v{a}tra\c{s}cu demonstrated how a single lower bound
for the static data structure problem of reachability in the butterfly graph,
could be used to derive a wealth of new and previous lower bounds via
reductions. These lower bounds are tight for numerous static data structure
problems. Moreover, he also showed that reachability in the butterfly graph
reduces to dynamic marked ancestor, a classic problem used to prove lower
bounds for dynamic data structures. Unfortunately, P\v{a}tra\c{s}cu's reduction
to marked ancestor loses a $\lg \lg n$ factor and therefore falls short of
fully recovering all the previous dynamic data structure lower bounds that
follow from marked ancestor. In this paper, we revisit P\v{a}tra\c{s}cu's work
and give a new lossless reduction to dynamic marked ancestor, thereby
establishing reachability in the butterfly graph as a single seed problem from
which a range of tight static and dynamic data structure lower bounds follow.

7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
8
The categories of this paper are: hep-ex
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
12
The categories of this paper are: nucl-th
13
The categories of this paper are: quant-ph
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
0
The categories of this paper are: hep-ph
29
The categories of this paper are: funct-an
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
26
The categories of this paper are: bayes-an