activity
20002020
most citedSpanning tree size in Random Binary Search Trees

13 citations · 16 across the 4 of their papers we have counts for

collaborators
Showing 2004Show all

2 papers · 1 filter

math.PR2004

Destruction of very simple trees

James Allen Fill, Nevin Kapur, Alois Panholzer

We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, -ary trees, and Cayley trees);…

math.PR2004★ 13 cited

Spanning tree size in Random Binary Search Trees

Alois Panholzer, Helmut Prodinger

This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normali…