On Robson's convergence and boundedness conjectures concerning the height of binary search trees
type: Item
instance of: scholarly article
title: On Robson's convergence and boundedness conjectures concerning the height of binary search trees
zbMATH Open document ID: 1086.68036
author: Michael Drmota
published in: Theoretical Computer Science
publication date: 2005-02-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 2132494
zbMATH Keywords: Binary search tree
zbMATH Keywords: Height distribution
zbMATH Keywords: Average case analysis
zbMATH Keywords: Generating functions
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.08.003
OpenAlex ID: W2111855548
Wikidata QID: Q122938514
cites work: The random multisection problem, travelling waves and the distribution of the height of \(m\)-ary search trees
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: The variance of the height of binary search trees
cites work: An analytic approach to the height of binary search trees II
cites work: Q4004056
cites work: On growing random binary trees
cites work: The height of a random binary search tree
cites work: On the concentration of the height of binary search trees
cites work: Constant bounds on the moments of the height of binary search trees
DOI: 10.1016/J.TCS.2004.08.003
description: scientific article; zbMATH DE number 2132494