Alois Panholzer

64 papers B 1C 1Journal 57Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
On Card Guessing Games: Limit Law for One-Time Riffle Shuffle.
Electron. J. Comb.
Markus Kuba, Alois Panholzer
2024 J jnl
On card guessing games: Limit law for no feedback one-time riffle shuffle.
Adv. Appl. Math.
Markus Kuba, Alois Panholzer
2023 J jnl
Tree evolution processes for bucket increasing trees.
Discret. Math.
Markus Kuba, Alois Panholzer
2022 J jnl
On bucket increasing trees, clustered increasing trees and increasing diamonds.
Comb. Probab. Comput.
Markus Kuba, Alois Panholzer
2022 C conf
Uncovering a Random Tree.
AofA
Benjamin Hackl, Alois Panholzer, Stephan Wagner
2021 J jnl
Parking function varieties for combinatorial tree models.
Adv. Appl. Math.
Alois Panholzer
2020 J jnl
A combinatorial approach for discrete car parking on random labelled trees.
J. Comb. Theory A
Alois Panholzer
2020 J jnl
Runs in labelled trees and mappings.
Discret. Math.
Marie-Louise Lackner, Alois Panholzer
2019 J jnl
Combinatorial Analysis of Growth Models for Series-Parallel Networks.
Comb. Probab. Comput.
Markus Kuba, Alois Panholzer
2019 J jnl
Stirling permutations containing a single pattern of length three.
Australas. J Comb.
Markus Kuba, Alois Panholzer
2018 J jnl
Probabilistic Analysis of the (1+1)-Evolutionary Algorithm.
Evol. Comput.
Hsien-Kuei Hwang, Alois Panholzer, Nicolas Rolin, Tsung-Hsi Tsai, Wei-Mei Chen
2016 J jnl
Combinatorial families of multilabelled increasing trees and hook-length formulas.
Discret. Math.
Markus Kuba, Alois Panholzer
2016 J jnl
Parking functions for mappings.
J. Comb. Theory A
Marie-Louise Lackner, Alois Panholzer
2014 J jnl
Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate".
Algorithmica
Ahmed Helmi, Conrado Martínez, Alois Panholzer
2014 J jnl
Ancestors and descendants in evolving
Random Struct. Algorithms
Alois Panholzer, Georg Seitz
2014 J jnl
Probabilistic analysis of the (1+1)-evolutionary algorithm.
CoRR
Hsien-Kuei Hwang, Alois Panholzer, Nicolas Rolin, Tsung-Hsi Tsai, Wei-Mei Chen
2013 J jnl
A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families.
Graphs Comb.
Markus Kuba, Alois Panholzer
2013 J jnl
Alternating mapping functions.
J. Comb. Theory A
Alois Panholzer
2013 J jnl
Analysis of a generalized Friedman's urn with multiple drawings.
Discret. Appl. Math.
Markus Kuba, Hosam M. Mahmoud, Alois Panholzer
2013 J jnl
Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem.
Algorithmica
Ahmed Helmi, Alois Panholzer
2012 — conf
Analysis of "Hiring Above the Median": A "Lake Wobegon" Strategy for The Hiring Problem.
ANALCO
Ahmed Helmi, Alois Panholzer
2012 J jnl
Bilabelled increasing trees and hook-length formulae.
Eur. J. Comb.
Markus Kuba, Alois Panholzer
2012 J jnl
Enumeration formulæ for pattern restricted Stirling permutations.
Discret. Math.
Markus Kuba, Alois Panholzer
2012 B conf
Hiring above the m-th Best Candidate: A Generalization of Records in Permutations.
LATIN
Ahmed Helmi, Conrado Martínez, Alois Panholzer
2011 J jnl
Analysis of Statistics for Generalized Stirling Permutations.
Comb. Probab. Comput.
Markus Kuba, Alois Panholzer
2011 J jnl
Generalized Stirling permutations, families of increasing trees and urn models.
J. Comb. Theory A
Svante Janson, Markus Kuba, Alois Panholzer
2011 J jnl
The analysis of Range Quickselect and related problems.
Theor. Comput. Sci.
Conrado Martínez, Alois Panholzer, Helmut Prodinger
2010 J jnl
A combinatorial approach to the analysis of bucket recursive trees.
Theor. Comput. Sci.
Markus Kuba, Alois Panholzer
2010 J jnl
Enumeration results for alternating tree families.
Eur. J. Comb.
Markus Kuba, Alois Panholzer
2010 J jnl
On the area under lattice paths associated with triangular diminishing urn models.
Adv. Appl. Math.
Markus Kuba, Alois Panholzer
2010 J jnl
On the distribution of distances between specified nodes in increasing trees.
Discret. Appl. Math.
Markus Kuba, Alois Panholzer
2009 J jnl
Analysis of three graph parameters for random trees.
Random Struct. Algorithms
Cyril Banderier, Markus Kuba, Alois Panholzer
2009 J jnl
Lattice Paths, Sampling Without Replacement, and Limiting Distributions.
Electron. J. Comb.
Markus Kuba, Alois Panholzer, Helmut Prodinger
2008 J jnl
A distributional study of the path edge-covering numbers for random trees.
Discret. Appl. Math.
Alois Panholzer
2008 J jnl
Analysis of Some Parameters for Random Nodes in Priority Trees.
Discret. Math. Theor. Comput. Sci.
Alois Panholzer
2008 — conf
Generating Random Derangements.
ANALCO
Conrado Martínez, Alois Panholzer, Helmut Prodinger
2008 J jnl
On edge-weighted recursive trees and inversions in random permutations.
Discret. Math.
Markus Kuba, Alois Panholzer
2008 J jnl
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees.
SIAM J. Discret. Math.
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
2007 — conf
Analysis of Insertion Costs in Priority Trees.
ANALCO
Markus Kuba, Alois Panholzer
2007 J jnl
Level of nodes in increasing trees revisited.
Random Struct. Algorithms
Alois Panholzer, Helmut Prodinger
2007 J jnl
On the degree distribution of the nodes in increasing trees.
J. Comb. Theory A
Markus Kuba, Alois Panholzer
2007 J jnl
The left-right-imbalance of binary search trees.
Theor. Comput. Sci.
Markus Kuba, Alois Panholzer
2006 J jnl
Descendants in Increasing Trees.
Electron. J. Comb.
Markus Kuba, Alois Panholzer
2006 J jnl
Destruction of Very Simple Trees.
Algorithmica
James Allen Fill, Nevin Kapur, Alois Panholzer
2005 J jnl
Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function.
J. Autom. Lang. Comb.
Alois Panholzer
2005 J jnl
The climbing depth of random trees.
Random Struct. Algorithms
Alois Panholzer
2005 J jnl
The distribution of the path edge-covering numbers for random trees.
Electron. Notes Discret. Math.
Alois Panholzer
2004 J jnl
Analysis of some statistics for increasing tree families.
Discret. Math. Theor. Comput. Sci.
Alois Panholzer, Helmut Prodinger
2004 J jnl
Distribution of the Steiner Distance in Generalized M-ary Search Trees.
Comb. Probab. Comput.
Alois Panholzer
2004 J jnl
On Some Parameters in Heap Ordered Trees.
Comb. Probab. Comput.
Kate Morris, Alois Panholzer, Helmut Prodinger
2004 J jnl
Permuting in place: analysis of two stopping rules.
J. Algorithms
Alois Panholzer, Helmut Prodinger, Marko Riedel
2004 J jnl
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees.
Random Struct. Algorithms
Alois Panholzer
2003 J jnl
Analysis of multiple quickselect variants.
Theor. Comput. Sci.
Alois Panholzer
2003 — conf
Non-crossing trees revisited: cutting down and spanning subtrees.
DRW
Alois Panholzer
2003 J jnl
The Height Distribution of Nodes in Non-Crossing Trees.
Ars Comb.
Alois Panholzer
2002 J jnl
Bijections for ternary trees and non-crossing trees.
Discret. Math.
Alois Panholzer, Helmut Prodinger
2002 J jnl
Noncrossing trees are almost conditioned Galton-Watson trees.
Random Struct. Algorithms
Jean-François Marckert, Alois Panholzer
2001 J jnl
Partial Match Queries in Relaxed Multidimensional Search Trees.
Algorithmica
Conrado Martinez, Alois Panholzer, Helmut Prodinger
1999 — —
Untersuchungen zur durchschnittlichen Gestalt gewisser Baumfamilien: mit besonderer Berücksichtigung von Anwendungen in der Informatik.
Alois Panholzer
1998 J jnl
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT.
Random Struct. Algorithms
Alois Panholzer, Helmut Prodinger
1998 J jnl
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.
Algorithmica
Alois Panholzer, Helmut Prodinger
1998 J jnl
On the Number of Descendants and Ascendants in Random Search Trees.
Electron. J. Comb.
Conrado Martinez, Alois Panholzer, Helmut Prodinger
1998 J jnl
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial.
Comput. J.
Alois Panholzer, Helmut Prodinger
1997 J jnl
Descendants and ascendants in binary trees.
Discret. Math. Theor. Comput. Sci.
Alois Panholzer, Helmut Prodinger