13 citations · 13 across the 1 of their papers we have counts for
2 papers
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…
math.CO2000
Kirkman's hypothesis revisited
A. Panholzer, H. Prodinger
Watson proved Kirkman's hypothesis (partially solved by Cayley). Using Lagrange Inversion, we drastically shorten Watson's computations and generalize his results at the same time.