Sciweavers

310 search results - page 2 / 62
» Randomized Binary Search Trees
Sort
View
CPC
2002
80views more  CPC 2002»
13 years 5 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 5 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
JACM
1998
52views more  JACM 1998»
13 years 5 months ago
Randomized Binary Search Trees
Conrado Martínez, Salvador Roura
IPL
2002
119views more  IPL 2002»
13 years 5 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk