default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlois Panholzer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j55]Markus Kuba
, Alois Panholzer:
On card guessing games: Limit law for no feedback one-time riffle shuffle. Adv. Appl. Math. 156: 102689 (2024)- 2023
- [j54]Markus Kuba, Alois Panholzer:
Tree evolution processes for bucket increasing trees. Discret. Math. 346(7): 113443 (2023) - 2022
- [j53]Markus Kuba, Alois Panholzer:
On bucket increasing trees, clustered increasing trees and increasing diamonds. Comb. Probab. Comput. 31(4): 629-661 (2022) - [c6]Benjamin Hackl, Alois Panholzer, Stephan Wagner:
Uncovering a Random Tree. AofA 2022: 10:1-10:17 - 2021
- [j52]Alois Panholzer:
Parking function varieties for combinatorial tree models. Adv. Appl. Math. 128: 102191 (2021) - 2020
- [j51]Marie-Louise Lackner, Alois Panholzer:
Runs in labelled trees and mappings. Discret. Math. 343(9): 111990 (2020) - [j50]Alois Panholzer:
A combinatorial approach for discrete car parking on random labelled trees. J. Comb. Theory A 173: 105233 (2020)
2010 – 2019
- 2019
- [j49]Markus Kuba, Alois Panholzer:
Stirling permutations containing a single pattern of length three. Australas. J Comb. 74: 216-239 (2019) - [j48]Markus Kuba, Alois Panholzer:
Combinatorial Analysis of Growth Models for Series-Parallel Networks. Comb. Probab. Comput. 28(4): 574-599 (2019) - 2018
- [j47]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) - 2016
- [j46]Markus Kuba, Alois Panholzer:
Combinatorial families of multilabelled increasing trees and hook-length formulas. Discret. Math. 339(1): 227-254 (2016) - [j45]Marie-Louise Lackner, Alois Panholzer:
Parking functions for mappings. J. Comb. Theory A 142: 1-28 (2016) - 2014
- [j44]Ahmed Helmi, Conrado Martínez, Alois Panholzer:
Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". Algorithmica 70(2): 267-300 (2014) - [j43]Alois Panholzer, Georg Seitz:
Ancestors and descendants in evolving k-tree models. Random Struct. Algorithms 44(4): 465-489 (2014) - [i1]Hsien-Kuei Hwang, Alois Panholzer, Nicolas Rolin, Tsung-Hsi Tsai, Wei-Mei Chen:
Probabilistic analysis of the (1+1)-evolutionary algorithm. CoRR abs/1409.4955 (2014) - 2013
- [j42]Ahmed Helmi, Alois Panholzer:
Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem. Algorithmica 66(4): 762-803 (2013) - [j41]Markus Kuba, Hosam M. Mahmoud, Alois Panholzer:
Analysis of a generalized Friedman's urn with multiple drawings. Discret. Appl. Math. 161(18): 2968-2984 (2013) - [j40]Markus Kuba, Alois Panholzer:
A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families. Graphs Comb. 29(6): 1839-1865 (2013) - [j39]Alois Panholzer:
Alternating mapping functions. J. Comb. Theory A 120(7): 1835-1850 (2013) - 2012
- [j38]Markus Kuba, Alois Panholzer:
Enumeration formulæ for pattern restricted Stirling permutations. Discret. Math. 312(21): 3179-3194 (2012) - [j37]Markus Kuba, Alois Panholzer:
Bilabelled increasing trees and hook-length formulae. Eur. J. Comb. 33(2): 248-258 (2012) - [c5]Ahmed Helmi, Alois Panholzer:
Analysis of "Hiring Above the Median": A "Lake Wobegon" Strategy for The Hiring Problem. ANALCO 2012: 75-83 - [c4]Ahmed Helmi, Conrado Martínez, Alois Panholzer:
Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. LATIN 2012: 470-481 - 2011
- [j36]Markus Kuba, Alois Panholzer:
Analysis of Statistics for Generalized Stirling Permutations. Comb. Probab. Comput. 20(6): 875-910 (2011) - [j35]Svante Janson, Markus Kuba, Alois Panholzer:
Generalized Stirling permutations, families of increasing trees and urn models. J. Comb. Theory A 118(1): 94-114 (2011) - [j34]Conrado Martínez, Alois Panholzer, Helmut Prodinger:
The analysis of Range Quickselect and related problems. Theor. Comput. Sci. 412(46): 6537-6555 (2011) - 2010
- [j33]Markus Kuba, Alois Panholzer:
On the area under lattice paths associated with triangular diminishing urn models. Adv. Appl. Math. 44(4): 329-358 (2010) - [j32]Markus Kuba, Alois Panholzer:
On the distribution of distances between specified nodes in increasing trees. Discret. Appl. Math. 158(5): 489-506 (2010) - [j31]Markus Kuba, Alois Panholzer:
Enumeration results for alternating tree families. Eur. J. Comb. 31(7): 1751-1780 (2010) - [j30]Markus Kuba, Alois Panholzer:
A combinatorial approach to the analysis of bucket recursive trees. Theor. Comput. Sci. 411(34-36): 3255-3273 (2010)
2000 – 2009
- 2009
- [j29]Markus Kuba, Alois Panholzer, Helmut Prodinger:
Lattice Paths, Sampling Without Replacement, and Limiting Distributions. Electron. J. Comb. 16(1) (2009) - [j28]Cyril Banderier, Markus Kuba, Alois Panholzer:
Analysis of three graph parameters for random trees. Random Struct. Algorithms 35(1): 42-69 (2009) - 2008
- [j27]Alois Panholzer:
A distributional study of the path edge-covering numbers for random trees. Discret. Appl. Math. 156(7): 1036-1052 (2008) - [j26]Markus Kuba, Alois Panholzer:
On edge-weighted recursive trees and inversions in random permutations. Discret. Math. 308(4): 529-540 (2008) - [j25]Alois Panholzer:
Analysis of Some Parameters for Random Nodes in Priority Trees. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - [j24]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): 160-184 (2008) - [c3]Conrado Martínez, Alois Panholzer, Helmut Prodinger:
Generating Random Derangements. ANALCO 2008: 234-240 - 2007
- [j23]Markus Kuba, Alois Panholzer:
On the degree distribution of the nodes in increasing trees. J. Comb. Theory A 114(4): 597-618 (2007) - [j22]Alois Panholzer, Helmut Prodinger:
Level of nodes in increasing trees revisited. Random Struct. Algorithms 31(2): 203-226 (2007) - [j21]Markus Kuba, Alois Panholzer:
The left-right-imbalance of binary search trees. Theor. Comput. Sci. 370(1-3): 265-278 (2007) - [c2]Markus Kuba, Alois Panholzer:
Analysis of Insertion Costs in Priority Trees. ANALCO 2007: 175-182 - 2006
- [j20]James Allen Fill, Nevin Kapur, Alois Panholzer:
Destruction of Very Simple Trees. Algorithmica 46(3-4): 345-366 (2006) - [j19]Markus Kuba, Alois Panholzer:
Descendants in Increasing Trees. Electron. J. Comb. 13(1) (2006) - 2005
- [j18]Alois Panholzer:
The distribution of the path edge-covering numbers for random trees. Electron. Notes Discret. Math. 19: 163-169 (2005) - [j17]Alois Panholzer:
Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function. J. Autom. Lang. Comb. 10(1): 79-97 (2005) - [j16]Alois Panholzer:
The climbing depth of random trees. Random Struct. Algorithms 26(1-2): 84-109 (2005) - 2004
- [j15]Kate Morris, Alois Panholzer, Helmut Prodinger:
On Some Parameters in Heap Ordered Trees. Comb. Probab. Comput. 13(4-5): 677-696 (2004) - [j14]Alois Panholzer:
Distribution of the Steiner Distance in Generalized M-ary Search Trees. Comb. Probab. Comput. 13(4-5): 717-733 (2004) - [j13]Alois Panholzer, Helmut Prodinger:
Analysis of some statistics for increasing tree families. Discret. Math. Theor. Comput. Sci. 6(2): 437-460 (2004) - [j12]Alois Panholzer, Helmut Prodinger, Marko Riedel:
Permuting in place: analysis of two stopping rules. J. Algorithms 51(2): 170-184 (2004) - [j11]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): 179-207 (2004) - 2003
- [j10]Alois Panholzer:
The Height Distribution of Nodes in Non-Crossing Trees. Ars Comb. 69 (2003) - [j9]Alois Panholzer:
Analysis of multiple quickselect variants. Theor. Comput. Sci. 302(1-3): 45-91 (2003) - [c1]Alois Panholzer:
Non-crossing trees revisited: cutting down and spanning subtrees. DRW 2003: 265-276 - 2002
- [j8]Alois Panholzer, Helmut Prodinger:
Bijections for ternary trees and non-crossing trees. Discret. Math. 250(1-3): 181-195 (2002) - [j7]Jean-François Marckert, Alois Panholzer:
Noncrossing trees are almost conditioned Galton-Watson trees. Random Struct. Algorithms 20(1): 115-125 (2002) - 2001
- [j6]Conrado Martinez, Alois Panholzer, Helmut Prodinger:
Partial Match Queries in Relaxed Multidimensional Search Trees. Algorithmica 29(1): 181-204 (2001)
1990 – 1999
- 1999
- [b1]Alois Panholzer:
Untersuchungen zur durchschnittlichen Gestalt gewisser Baumfamilien: mit besonderer Berücksichtigung von Anwendungen in der Informatik. Vienna University of Technology, Austria, Österr. Kunst- und Kulturverl. 1999, ISBN 978-3-85437-176-2, pp. 1-219 - 1998
- [j5]Alois Panholzer, Helmut Prodinger:
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. Algorithmica 22(4): 600-630 (1998) - [j4]Alois Panholzer, Helmut Prodinger:
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial. Comput. J. 41(3): 201-204 (1998) - [j3]Conrado Martinez, Alois Panholzer, Helmut Prodinger:
On the Number of Descendants and Ascendants in Random Search Trees. Electron. J. Comb. 5 (1998) - [j2]Alois Panholzer, Helmut Prodinger:
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. Random Struct. Algorithms 13(3-4): 189-209 (1998) - 1997
- [j1]Alois Panholzer, Helmut Prodinger:
Descendants and ascendants in binary trees. Discret. Math. Theor. Comput. Sci. 1(2): 247-266 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
