The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On the Average Stack Size of Regularly Distributed Binary Trees
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
A compendium of key search references
ACM SIGIR Forum
Optimal Prioritized Conflict Resolution on a Multiple Access Channel
IEEE Transactions on Computers
Computer-assisted microanalysis of parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strong concentration for Quicksort
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
WSC '92 Proceedings of the 24th conference on Winter simulation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Variance of the height of binary search trees
Theoretical Computer Science
Constant bounds on the moments of the height of binary search trees
Theoretical Computer Science
The height of a binary search tree: the limiting distribution perspective
Theoretical Computer Science
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
The height of a random binary search tree
Journal of the ACM (JACM)
An analytic approach to the height of binary search trees II
Journal of the ACM (JACM)
Random Structures & Algorithms
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
Combinatorics, Probability and Computing
Experiments with balanced-sample binary trees
Proceedings of the 36th SIGCSE technical symposium on Computer science education
On Robson's convergence and boundedness conjectures concerning the height of binary search trees
Theoretical Computer Science
Extremal Weighted Path Lengths In Random Binary Search Trees
Probability in the Engineering and Informational Sciences
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
Information Processing Letters
Average case analysis for tree labelling schemes
Theoretical Computer Science
Smoothed analysis of binary search trees
Theoretical Computer Science
Consistency of Random Forests and Other Averaging Classifiers
The Journal of Machine Learning Research
Random records and cuttings in binary search trees
Combinatorics, Probability and Computing
SplitQuest: controlled and exhaustive search in peer-to-peer networks
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
Randomly generating triangulations of a simple polygon
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Computing the visibility polygon using few variables
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Depth Properties of scaled attachment random recursive trees
Random Structures & Algorithms
Accounting for gene tree uncertainties improves gene trees and reconciliation inference
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Fast error-tolerant quartet phylogeny algorithms
Theoretical Computer Science
| Hi-index | 0.01 |
Let Hn be the height of a binary search tree with n nodes constructed by standard insertions from a random permutation of 1, … , n. It is shown that Hn/log n → c = 4.31107 … in probability as n → ∞, where c is the unique solution of c log((2e)/c) = 1, c ≥ 2. Also, for all p 0, limn→∞E(Hpn)/ logpn = cp. Finally, it is proved that Sn/log n → c* = 0.3733 … , in probability, where c* is defined by c log((2e)/c) = 1, c ≤ 1, and Sn is the saturation level of the same tree, that is, the number of full levels in the tree.