7 citations · 10 across the 5 of their papers we have counts for
5 papers
On Card guessing with two types of cards
Markus Kuba, Alois Panholzer
We consider a card guessing strategy for a stack of cards with two different types of cards, say cards of type red (heart or diamond) and cards of type black (clubs or…
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…
Combinatorial families of multilabelled increasing trees and hook-length formulas
Markus Kuba, Alois Panholzer
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its par…
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…
Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model
Alois Panholzer, Georg Seitz
We introduce a random graph model based on k-trees, which can be generated by applying a probabilistic preferential attachment rule, but which also has a simple combinatorial descr…