Fringe analysis revisited-Reference-Cited by-同舟云学术

Fringe analysis revisited

Published:1995-03 Issue:1 Volume:27 Page:109-119
ISSN:0360-0300
Container-title:ACM Computing Surveys
language:en
Short-container-title:ACM Comput. Surv.

Author:

Baeza-Yates Ricardo A.¹

Affiliation:

1. Univ. de Chile, Santiago, Chile

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

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/214037.214103

Reference57 articles.

1. ABRAMOWITZ M. AND STEGUN I. 1972. Handbook of Mathematical Functions. Dover New York. ABRAMOWITZ M. AND STEGUN I. 1972. Handbook of Mathematical Functions. Dover New York.

2. _ Two applications of urn processes: The fringe analysis of search trees and the simulation of quasi-stationary distributions of Markov chains;ALDOUS D.;Probab. Eng Inf. Scl,1988

3. BAEZA-YATES R. A. 1985. Analysis of algorithms in ~qearch tre~a. Master's thesis Dept. of Computer Science Univ. of Chile Santiago Jan. (In Spanish ) BAEZA-YATES R. A. 1985. Analysis of algorithms in ~qearch tre~a. Master's thesis Dept. of Computer Science Univ. of Chile Santiago Jan. (In Spanish )

4. BAEZA-YATES R. A. 1987a. Analyzing deletions in B-trees Dept. of Computer Science Univ. of Waterloo Ontario. Canada. (Unpublished manuscript.) BAEZA-YATES R. A. 1987a. Analyzing deletions in B-trees Dept. of Computer Science Univ. of Waterloo Ontario. Canada. (Unpublished manuscript.)

5. Some average measures in m-ary search trees

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Performance of Linear and Spiral Hashing Algorithms;Algorithms;2024-09-07

2. Balancing m-ary search trees with compressions on the fringe;Acta Informatica;2023-12-15

3. Persistently cached B-trees;IEEE Transactions on Knowledge and Data Engineering;2003-05

4. Fringe analysis of synchronized parallel insertion algorithms in 2–3 Trees;Theoretical Computer Science;2003-04

5. Datentypen zur Darstellung von Mengen;Datenstrukturen und Algorithmen;2003