Distribution of the Steiner Distance in Generalized M-ary Search Trees

DOI10.1017/S0963548304006212zbMath1069.60009OpenAlexW2037523579MaRDI QIDQ4670362

Alois Panholzer

Publication date: 18 April 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548304006212

zbMATH Keywords

asymptotic normalityquicksort

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Searching and sorting (68P10) Combinatorics in computer science (68R05) Combinatorial probability (60C05)

Related Items (3)

A combinatorial approach to the analysis of bucket recursive trees ⋮ Analysis of Steiner subtrees of random trees for traceroute algorithms ⋮ Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees

This page was built for publication: Distribution of the Steiner Distance in Generalized M-ary Search Trees