29 search results - page 1 / 6» Smoothed Analysis of Binary Search Trees |

DAGSTUHL

2007

13 years 9 months ago
2007

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...

ISAAC

2005

Springer

14 years 1 months ago
2005

Springer

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...

ALGORITHMICA

2006

13 years 8 months ago
2006

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...

ACMSE

2007

ACM

14 years 1 days ago
2007

ACM

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...

IJCNN

2000

IEEE

14 years 12 days ago
2000

IEEE

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...