Alois Panholzer

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 12

Top Venues

Discret. Math.

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Adv. Appl. Math.

Vienna University of Technology, Austria (PHD)

Education History

Vienna University of Technology, Austria

PHD

Publications

Markus Kuba, Alois Panholzer
On card guessing games: Limit law for no feedback one-time riffle shuffle. Adv. Appl. Math. 156 (2024)
Markus Kuba, Alois Panholzer
Tree evolution processes for bucket increasing trees. Discret. Math. 346 (7) (2023)
Markus Kuba, Alois Panholzer
On bucket increasing trees, clustered increasing trees and increasing diamonds. Comb. Probab. Comput. 31 (4) (2022)
Benjamin Hackl, Alois Panholzer, Stephan Wagner
Uncovering a Random Tree. AofA (2022)
Alois Panholzer
Parking function varieties for combinatorial tree models. Adv. Appl. Math. 128 (2021)
Alois Panholzer
A combinatorial approach for discrete car parking on random labelled trees. J. Comb. Theory, Ser. A 173 (2020)
Marie-Louise Lackner, Alois Panholzer
Runs in labelled trees and mappings. Discret. Math. 343 (9) (2020)
Markus Kuba, Alois Panholzer
Stirling permutations containing a single pattern of length three. Australas. J Comb. 74 (2019)
Markus Kuba, Alois Panholzer
Combinatorial Analysis of Growth Models for Series-Parallel Networks. Comb. Probab. Comput. 28 (4) (2019)
Hsien-Kuei Hwang, Alois Panholzer, Nicolas Rolin, Tsung-Hsi Tsai, Wei-Mei Chen
Probabilistic Analysis of the (1+1)-Evolutionary Algorithm. Evol. Comput. 26 (2) (2018)
Markus Kuba, Alois Panholzer
Combinatorial families of multilabelled increasing trees and hook-length formulas. Discret. Math. 339 (1) (2016)
Marie-Louise Lackner, Alois Panholzer
Parking functions for mappings. J. Comb. Theory, Ser. A 142 (2016)
Ahmed Helmi, Conrado Martínez, Alois Panholzer
Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". Algorithmica 70 (2) (2014)
Hsien-Kuei Hwang, Alois Panholzer, Nicolas Rolin, Tsung-Hsi Tsai, Wei-Mei Chen
Probabilistic analysis of the (1+1)-evolutionary algorithm. CoRR (2014)
Alois Panholzer, Georg Seitz
-tree models. Random Struct. Algorithms 44 (4) (2014)
Markus Kuba, Alois Panholzer
A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families. Graphs Comb. 29 (6) (2013)
Alois Panholzer
Alternating mapping functions. J. Comb. Theory, Ser. A 120 (7) (2013)
Markus Kuba, Hosam M. Mahmoud, Alois Panholzer
Analysis of a generalized Friedman's urn with multiple drawings. Discret. Appl. Math. 161 (18) (2013)
Ahmed Helmi, Alois Panholzer
Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem. Algorithmica 66 (4) (2013)
Markus Kuba, Alois Panholzer
Enumeration formulæ for pattern restricted Stirling permutations. Discret. Math. 312 (21) (2012)
Ahmed Helmi, Alois Panholzer
Analysis of "Hiring Above the Median": A "Lake Wobegon" Strategy for The Hiring Problem. ANALCO (2012)
Ahmed Helmi, Conrado Martínez, Alois Panholzer
Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. LATIN (2012)
Markus Kuba, Alois Panholzer
Bilabelled increasing trees and hook-length formulae. Eur. J. Comb. 33 (2) (2012)
Markus Kuba, Alois Panholzer
Analysis of Statistics for Generalized Stirling Permutations. Comb. Probab. Comput. 20 (6) (2011)
Conrado Martínez, Alois Panholzer, Helmut Prodinger
The analysis of Range Quickselect and related problems. Theor. Comput. Sci. 412 (46) (2011)
Svante Janson, Markus Kuba, Alois Panholzer
Generalized Stirling permutations, families of increasing trees and urn models. J. Comb. Theory, Ser. A 118 (1) (2011)
Markus Kuba, Alois Panholzer
A combinatorial approach to the analysis of bucket recursive trees. Theor. Comput. Sci. 411 (34-36) (2010)
Markus Kuba, Alois Panholzer
On the area under lattice paths associated with triangular diminishing urn models. Adv. Appl. Math. 44 (4) (2010)
Markus Kuba, Alois Panholzer
Enumeration results for alternating tree families. Eur. J. Comb. 31 (7) (2010)
Markus Kuba, Alois Panholzer
On the distribution of distances between specified nodes in increasing trees. Discret. Appl. Math. 158 (5) (2010)
Markus Kuba, Alois Panholzer, Helmut Prodinger
Lattice Paths, Sampling Without Replacement, and Limiting Distributions. Electron. J. Comb. 16 (1) (2009)
Cyril Banderier, Markus Kuba, Alois Panholzer
Analysis of three graph parameters for random trees. Random Struct. Algorithms 35 (1) (2009)
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees. SIAM J. Discret. Math. 22 (1) (2008)
Alois Panholzer
Analysis of Some Parameters for Random Nodes in Priority Trees. Discret. Math. Theor. Comput. Sci. 10 (2) (2008)
Alois Panholzer
A distributional study of the path edge-covering numbers for random trees. Discret. Appl. Math. 156 (7) (2008)
Markus Kuba, Alois Panholzer
On edge-weighted recursive trees and inversions in random permutations. Discret. Math. 308 (4) (2008)
Conrado Martínez, Alois Panholzer, Helmut Prodinger
Generating Random Derangements. ANALCO (2008)
Markus Kuba, Alois Panholzer
Analysis of Insertion Costs in Priority Trees. ANALCO (2007)
Markus Kuba, Alois Panholzer
The left-right-imbalance of binary search trees. Theor. Comput. Sci. 370 (1-3) (2007)
Alois Panholzer, Helmut Prodinger
Level of nodes in increasing trees revisited. Random Struct. Algorithms 31 (2) (2007)
Markus Kuba, Alois Panholzer
On the degree distribution of the nodes in increasing trees. J. Comb. Theory, Ser. A 114 (4) (2007)
Markus Kuba, Alois Panholzer
Descendants in Increasing Trees. Electron. J. Comb. 13 (1) (2006)
James Allen Fill, Nevin Kapur, Alois Panholzer
Destruction of Very Simple Trees. Algorithmica 46 (3-4) (2006)
Alois Panholzer
The climbing depth of random trees. Random Struct. Algorithms 26 (1-2) (2005)
Alois Panholzer
The distribution of the path edge-covering numbers for random trees. Electron. Notes Discret. Math. 19 (2005)
Alois Panholzer
Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function. J. Autom. Lang. Comb. 10 (1) (2005)
Alois Panholzer, Helmut Prodinger
Analysis of some statistics for increasing tree families. Discret. Math. Theor. Comput. Sci. 6 (2) (2004)
Kate Morris, Alois Panholzer, Helmut Prodinger
On Some Parameters in Heap Ordered Trees. Comb. Probab. Comput. 13 (4-5) (2004)
Alois Panholzer
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. Random Struct. Algorithms 25 (2) (2004)
Alois Panholzer
Distribution of the Steiner Distance in Generalized M-ary Search Trees. Comb. Probab. Comput. 13 (4-5) (2004)
Alois Panholzer, Helmut Prodinger, Marko Riedel
Permuting in place: analysis of two stopping rules. J. Algorithms 51 (2) (2004)
Alois Panholzer
The Height Distribution of Nodes in Non-Crossing Trees. Ars Comb. 69 (2003)
Alois Panholzer
Non-crossing trees revisited: cutting down and spanning subtrees. DRW (2003)
Alois Panholzer
Analysis of multiple quickselect variants. Theor. Comput. Sci. 302 (1-3) (2003)
Jean-François Marckert, Alois Panholzer
Noncrossing trees are almost conditioned Galton-Watson trees. Random Struct. Algorithms 20 (1) (2002)
Alois Panholzer, Helmut Prodinger
Bijections for ternary trees and non-crossing trees. Discret. Math. 250 (1-3) (2002)
Conrado Martinez, Alois Panholzer, Helmut Prodinger
Partial Match Queries in Relaxed Multidimensional Search Trees. Algorithmica 29 (1) (2001)
Alois Panholzer, Helmut Prodinger
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. Algorithmica 22 (4) (1998)
Conrado Martinez, Alois Panholzer, Helmut Prodinger
On the Number of Descendants and Ascendants in Random Search Trees. Electron. J. Comb. 5 (1998)
Alois Panholzer, Helmut Prodinger
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial. Comput. J. 41 (3) (1998)
Alois Panholzer, Helmut Prodinger
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. Random Struct. Algorithms 13 (3-4) (1998)
Alois Panholzer, Helmut Prodinger
Descendants and ascendants in binary trees. Discret. Math. Theor. Comput. Sci. 1 (2) (1997)

Alois Panholzer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alois Panholzer