Universal Limit Laws for Depths in Random Trees

Authors:
Luc Devroye
Affiliations:
-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 5

On binary search tree recursions with monomials as toll functions

Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms

Journal of Algorithms - Analysis of algorithms
Distribution of the Steiner Distance in Generalized M-ary Search Trees

Combinatorics, Probability and Computing
Phase changes in random point quadtrees

ACM Transactions on Algorithms (TALG)
SplitQuest: controlled and exhaustive search in peer-to-peer networks

IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these trees, we offer a universal law of large numbers and a limit law for the depth of the last inserted point, as well as a law of large numbers for the height.