Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case
  Access Times   We present the zipper tree, an $O(\log \log n)$-competitive online binary
search tree that performs each access in $O(\log n)$ worst-case time. This
shows that for binary search trees, optimal worst-case access time and
near-optimal amortized access time can be guaranteed simultaneously.

6
The categories of this paper are: astro-ph
37
The categories of this paper are: supr-con
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
0
The categories of this paper are: hep-ph
34
The categories of this paper are: chem-ph
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
8
The categories of this paper are: hep-ex
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex