The height of a random binary search tree
From MaRDI portal
Publication:3452494
DOI10.1145/765568.765571zbMath1325.68076OpenAlexW2076172709WikidataQ56688557 ScholiaQ56688557MaRDI QIDQ3452494
Publication date: 12 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/765568.765571
Related Items (28)
Longest Path Distance in Random Circuits ⋮ Average case analysis for tree labelling schemes ⋮ Smoothed analysis of binary search trees ⋮ Some new results for McKean's graphs with applications to Kac's equation ⋮ An Improved Bound for Random Binary Search Trees with Concurrent Insertions ⋮ Quenched invariance principles for the maximal particle in branching random walk in random environment and the parabolic Anderson model ⋮ Differential privacy in constant function market makers ⋮ The height of record‐biased trees ⋮ Zip-zip trees: making zip trees more balanced, biased, compact, or persistent ⋮ Erasure-Resilient Property Testing ⋮ On the Most Likely Voronoi Diagram and Nearest Neighbor Searching ⋮ Property-preserving data reconstruction ⋮ The height of increasing trees ⋮ Deletions in random binary search trees: a story of errors ⋮ On Robson's convergence and boundedness conjectures concerning the height of binary search trees ⋮ On the Depth of the Trees in the Mckean Representation of Wild's Sums ⋮ Minima in branching random walks ⋮ Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise ⋮ The variance of the height of binary search trees ⋮ Verified analysis of random binary tree structures ⋮ Towards Efficient Fully Randomized Message-Locked Encryption ⋮ Tightness for a family of recursion equations ⋮ The height of Mallows trees ⋮ Tightness for the minimal displacement of branching random walk ⋮ Correction terms for the height of weighted recursive trees ⋮ Towards convergence rate analysis of random forests for classification ⋮ EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES ⋮ Extreme value statistics and traveling fronts: Various applications
This page was built for publication: The height of a random binary search tree
