Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
We present the zipper tree, the first 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 ...