234 search results - page 4 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
STACS
1999
Springer
13 years 10 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
TCS
2008
13 years 6 months ago
2008
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...
SWAT
2010
Springer
13 years 11 months ago
2010
Springer
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 ...
CPC
2008
13 years 6 months ago
2008
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
ISPDC
2008
IEEE
14 years 19 days ago
2008
IEEE
We present a load-balancing technique that exploits the temporal coherence, among successive computation phases, in mesh-like computations to be mapped on a cluster of processors....