The height of a binary search tree: the limiting distribution perspective.
type: Item
instance of: scholarly article
title: The height of a binary search tree: the limiting distribution perspective.
zbMATH Open document ID: 1061.68039
DOI: 10.1016/S0304-3975(01)00387-5
author: Charles Knessl
author: Wojciech Szpankowski
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1857083
zbMATH Keywords: Binary search trees
zbMATH Keywords: Limiting height distribution
zbMATH Keywords: Saddle point method
zbMATH Keywords: Matched asymptotics
zbMATH Keywords: Linearization
zbMATH Keywords: WKB method
zbMATH Keywords: Nonlinear integral equation
MaRDI profile type: Publication
cites work: Q4222737
cites work: Differential-difference equations
cites work: Q3207312
cites work: A note on the height of binary search trees
cites work: Branching processes in the analysis of the heights of trees
cites work: On the Variance of the Height of Random Binary Search Trees
cites work: An analytic approach to the height of binary search trees
cites work: Q3802018
cites work: Singularity Analysis of Generating Functions
cites work: Q5843703
cites work: Q4349924
cites work: Q3836519
cites work: Q4508387
cites work: Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
cites work: Singular Perturbation Analysis of Boundary Value Problems for Differential-Difference Equations. V. Small Shifts with Layer Behavior
cites work: Exact and asymptotic distributions in digital and binary search trees
cites work: Q4004056
cites work: Q4264396
cites work: Q3895818
cites work: Q4871770
cites work: On growing random binary trees
cites work: How tall is a tree?
cites work: Special issue: Average-case analysis of algorithms
cites work: Q3993278
description: scientific article; zbMATH DE number 1857083