#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1994

2018

- This year (4)
- Last 5 years (9)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alois Panholzer, Helmut Prodinger
- Random Struct. Algorithms
- 2007

Abstract. Simply generated families of trees are described by the equation T (z) = Ï†(T (z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a labelâ€¦ (More)

- Svante Janson, Markus Kuba, Alois Panholzer
- J. Comb. Theory, Ser. A
- 2011

Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the connection betweenâ€¦ (More)

- Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
- SIAM J. Discrete Math.
- 2008

Abstract. We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtrees of sizeâ€¦ (More)

- Alois Panholzer
- 2006

We study here, by using a recursive approach, the number of random cuts that are necessary to destroy a random tree of size n for simply generated tree families. Crucial for the applicability of suchâ€¦ (More)

- Markus Kuba, Alois Panholzer
- J. Comb. Theory, Ser. A
- 2007

Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e., labellings of the nodes byâ€¦ (More)

- Markus Kuba, Alois Panholzer
- Electr. J. Comb.
- 2006

Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellings of the nodes byâ€¦ (More)

We analyze a fringe tree parameter w in a variety of settings, utilizing a variety of methods from the analysis of algorithms and data structures. Given a tree t and one of its leaves a, the w(t,a)â€¦ (More)

- Alois Panholzer
- 2004

We study, for the family of recursive trees, two procedures that destroy trees by successively removing edges. In both variants, one starts with a tree T of size n and chooses one of the n âˆ’ 1 edgesâ€¦ (More)

- Alois Panholzer
- DRW
- 2003

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching andâ€¦ (More)

- Conrado MartÃnez, Alois Panholzer, Helmut Prodinger
- Algorithmica
- 2001

Partial match queries arise frequently in the context of large databases, where each record contains a distinct multidimensional key, that is, the key of each record is aK-tuple of values. Theâ€¦ (More)