On Robson's convergence and boundedness conjectures concerning the height of binary search trees
From MaRDI portal
Publication:706615
DOI10.1016/j.tcs.2004.08.003zbMath1086.68036OpenAlexW2111855548WikidataQ122938514 ScholiaQ122938514MaRDI QIDQ706615
Publication date: 9 February 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.08.003
Related Items (1)
Cites Work
- Unnamed Item
- The random multisection problem, travelling waves and the distribution of the height of \(m\)-ary search trees
- On growing random binary trees
- Branching processes in the analysis of the heights of trees
- Constant bounds on the moments of the height of binary search trees
- An analytic approach to the height of binary search trees
- The height of a random binary search tree
- An analytic approach to the height of binary search trees II
- A note on the height of binary search trees
- On the concentration of the height of binary search trees
- On the Variance of the Height of Random Binary Search Trees
- The variance of the height of binary search trees
This page was built for publication: On Robson's convergence and boundedness conjectures concerning the height of binary search trees