Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Novel O(H(N)+N/H(N)) Algorithmic Techniques for Several Types of Queries
  and Updates on Rooted Trees and Lists   In this paper we present novel algorithmic techniques with a O(H(N)+N/H(N))
time complexity for performing several types of queries and updates on general
rooted trees, binary search trees and lists of size N. For rooted trees we
introduce a new compressed super-node tree representation which can be used for
efficiently addressing a wide range of applications. For binary search trees we
discuss the idea of globally rebuilding the entire tree in a fully balanced
manner whenever the height of the tree exceeds the value of a conveniently
chosen function of the number of tree nodes. In the end of the paper we
introduce the H-list data structure which supports concatenation, split and
several types of queries. Note that when choosing H(N)=sqrt(N) we obtain
O(H(N)+N/H(N))=O(sqrt(N)).

25
The categories of this paper are: patt-sol
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
13
The categories of this paper are: quant-ph
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat
3
The categories of this paper are: physics
19
The categories of this paper are: eess
16
The categories of this paper are: stat
30
The categories of this paper are: q-alg
2
The categories of this paper are: math