21 citations · 76 across the 24 of their papers we have counts for
6 papers · 1 filter
A note on the limit law of one-sided tree destruction
Markus Kuba, Alois Panholzer
This short note serves an addendum to the article "Destruction of very simple trees" by Fill, Kapur and Panholzer (2004). Therein, the limit law of one-sided tree destruction with…
The Uncover Process for Random Labeled Trees
Benjamin Hackl, Alois Panholzer, Stephan Wagner
We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with vertices is generated uniformly at random. The…
Probabilistic analysis of the (1+1)-evolutionary algorithm
Hsien-Kuei Hwang, Alois Panholzer, Nicolas Rolin +2
We give a detailed analysis of the cost used by the (1+1)-evolutionary algorithm. The problem has been approached in the evolutionary algorithm literature under various views, form…
On death processes and urn models
Markus Kuba, Alois Panholzer
We use death processes and embeddings into continuous time in order to analyze several urn models with a diminishing content. In particular we discuss generalizations of the pill's…
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);…
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…