Spanning tree size in random binary search trees.

DOI10.1214/105051604000000071zbMath1126.68031arXivmath/0405292OpenAlexW3102736130MaRDI 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

Central limit and other weak theorems (60F05) Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Data structures (68P05)

Related Items (8)

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

This page was built for publication: Spanning tree size in random binary search trees.