Sciweavers

Share
29 search results - page 1 / 6
» Smoothed Analysis of Binary Search Trees
Sort
View
DAGSTUHL
2007
12 years 7 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
12 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
ALGORITHMICA
2006
84views more  ALGORITHMICA 2006»
12 years 5 months ago
Large Deviations for the Weighted Height of an Extended Class of Trees
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
Nicolas Broutin, Luc Devroye
ACMSE
2007
ACM
12 years 9 months ago
Exploring the duality between skip lists and binary search trees
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
Brian C. Dean, Zachary H. Jones
IJCNN
2000
IEEE
12 years 10 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index ef´Čüciency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
books