Fringe Analysis Revisited

by Ricardo A. Baeza-yates

Citations:

12 - 6 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Fringe Analysis Revisited	user correction - Legacy Corrections
AUTHOR NAME	Ricardo A. Baeza-yates	SVM HeaderParse 0.1
AUTHOR ADDR	Universidad de Chile; Blanco Encalada 2120; Santiago, Chile	SVM HeaderParse 0.1
ABSTRACT	Fringe analysis is a technique used to study the average behavior of search trees. In this paper we survey the main results regarding this technique, and we improve a previous asymptotic theorem. At the same time we present new developments and applications of the theory which allow improvements in several bounds on the behavior of search trees. Our examples cover binary search trees, AVL trees, 2-3 trees, and B-trees. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity ]: Nonnumerical Algorithms and Problems -- computations on discrete structures; sorting and searching; E.1 [Data Structures]; trees. Contents 1 Introduction 2 2 The Theory of Fringe Analysis 4 3 Weakly Closed Collections 9 4 Including the Level Information 11 5 Fringe Analysis, Markov Chains, and Urn Processes 13 This work was partially funded by Research Grant FONDECYT 93-0765. e-mail: rbaeza@dcc.uchile.cl 1 Introduction Search trees are one of the most used data structures t...	user correction - Legacy Corrections
CITATIONS	59 found	ParsCit 1.0