Spanning tree size in random binary search trees.

DOI10.1214/105051604000000071zbMath1126.68031arXivmath/0405292MaRDI QIDQ1879887

Prodinger, Helmut, Alois Panholzer

Publication date: 15 September 2004

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0405292

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

68P10: Searching and sorting

05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability

68P05: Data structures

Related Items

The Wiener Index of Random Digital Trees, Tree limits and limits of random trees, The oscillatory distribution of distances in random tries, Distances in random digital search trees, Limit laws for the Randić index of random binary tree models, On weighted depths in random binary search trees, Analysis of Steiner subtrees of random trees for traceroute algorithms, Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematics for the analysis of algorithms.
• On convergence rates in the central limit theorems for combinatorial structures
• Distribution of distances in random binary search trees.
• Singularity Analysis of Generating Functions
• The Wiener Index of simply generated random trees
• A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
• On the distribution of distances in recursive trees