On Card Guessing Games: Limit Law for One-Time Riffle Shuffle.

Alois Panholzer https://orcid.org/0000-0003-2813-3457

Markus Kuba Alois Panholzer On Card Guessing Games: Limit Law for One-Time Riffle Shuffle. 2025 32 Electron. J. Comb. 3 https://doi.org/10.37236/13539 db/journals/combinatorics/combinatorics32.html#KubaP25 streams/journals/combinatorics

Markus Kuba Alois Panholzer On card guessing games: Limit law for no feedback one-time riffle shuffle. 102689 2024 156 Adv. Appl. Math. https://doi.org/10.1016/j.aam.2024.102689 db/journals/aam/aam156.html#KubaP24

Markus Kuba Alois Panholzer Tree evolution processes for bucket increasing trees. 113443 2023 July 346 Discret. Math. 7 https://doi.org/10.1016/j.disc.2023.113443 db/journals/dm/dm346.html#KubaP23

Markus Kuba Alois Panholzer On bucket increasing trees, clustered increasing trees and increasing diamonds. 629-661 2022 31 Comb. Probab. Comput. 4 https://doi.org/10.1017/S0963548321000493 db/journals/cpc/cpc31.html#KubaP22

Benjamin Hackl Alois Panholzer Stephan Wagner 0003 Uncovering a Random Tree. 10:1-10:17 2022 AofA https://doi.org/10.4230/LIPIcs.AofA.2022.10 conf/aofa/2022 db/conf/aofa/aofa2022.html#HacklP022

Alois Panholzer Parking function varieties for combinatorial tree models. 102191 2021 128 Adv. Appl. Math. https://doi.org/10.1016/j.aam.2021.102191 db/journals/aam/aam128.html#Panholzer21

Marie-Louise Lackner Alois Panholzer Runs in labelled trees and mappings. 111990 2020 343 Discret. Math. 9 https://doi.org/10.1016/j.disc.2020.111990 db/journals/dm/dm343.html#LacknerP20

Alois Panholzer A combinatorial approach for discrete car parking on random labelled trees. 105233 2020 173 J. Comb. Theory A https://doi.org/10.1016/j.jcta.2020.105233 db/journals/jcta/jcta173.html#Panholzer20

Markus Kuba Alois Panholzer Stirling permutations containing a single pattern of length three. 216-239 2019 74 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/74/ajc_v74_p216.pdf db/journals/ajc/ajc74.html#KubaP19

Markus Kuba Alois Panholzer Combinatorial Analysis of Growth Models for Series-Parallel Networks. 574-599 2019 28 Comb. Probab. Comput. 4 https://doi.org/10.1017/S096354831800038X https://www.wikidata.org/entity/Q129375917 db/journals/cpc/cpc28.html#KubaP19

Hsien-Kuei Hwang Alois Panholzer Nicolas Rolin Tsung-Hsi Tsai Wei-Mei Chen Probabilistic Analysis of the (1+1)-Evolutionary Algorithm. 2018 26 Evol. Comput. 2 https://doi.org/10.1162/evco_a_00212 https://www.wikidata.org/entity/Q47794969 db/journals/ec/ec26.html#HwangPRTC18

Markus Kuba Alois Panholzer Combinatorial families of multilabelled increasing trees and hook-length formulas. 227-254 2016 339 Discret. Math. 1 https://doi.org/10.1016/j.disc.2015.08.010 db/journals/dm/dm339.html#KubaP16

Marie-Louise Lackner Alois Panholzer Parking functions for mappings. 1-28 2016 142 J. Comb. Theory A https://doi.org/10.1016/j.jcta.2016.03.001 db/journals/jct/jcta142.html#LacknerP16

Ahmed Helmi 0001 Conrado Martínez Alois Panholzer Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". 267-300 2014 70 Algorithmica 2 https://doi.org/10.1007/s00453-014-9895-3 https://www.wikidata.org/entity/Q61734775 db/journals/algorithmica/algorithmica70.html#HelmiMP14

Alois Panholzer Georg Seitz Ancestors and descendants in evolving <i>k</i>-tree models. 465-489 2014 44 Random Struct. Algorithms 4 https://doi.org/10.1002/rsa.20474 db/journals/rsa/rsa44.html#PanholzerS14

Hsien-Kuei Hwang Alois Panholzer Nicolas Rolin Tsung-Hsi Tsai Wei-Mei Chen Probabilistic analysis of the (1+1)-evolutionary algorithm. 2014 abs/1409.4955 CoRR http://arxiv.org/abs/1409.4955 db/journals/corr/corr1409.html#HwangPRTC14

Ahmed Helmi 0001 Alois Panholzer Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem. 762-803 2013 66 Algorithmica 4 https://doi.org/10.1007/s00453-012-9727-2 db/journals/algorithmica/algorithmica66.html#HelmiP13

Markus Kuba Hosam M. Mahmoud Alois Panholzer Analysis of a generalized Friedman's urn with multiple drawings. 2968-2984 2013 161 Discret. Appl. Math. 18 https://doi.org/10.1016/j.dam.2013.06.022 db/journals/dam/dam161.html#KubaMP13

Markus Kuba Alois Panholzer A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families. 1839-1865 2013 29 Graphs Comb. 6 https://doi.org/10.1007/s00373-012-1217-4 db/journals/gc/gc29.html#KubaP13

Alois Panholzer Alternating mapping functions. 1835-1850 2013 120 J. Comb. Theory A 7 https://doi.org/10.1016/j.jcta.2013.07.005 db/journals/jct/jcta120.html#Panholzer13

Markus Kuba Alois Panholzer Enumeration formulæ for pattern restricted Stirling permutations. 3179-3194 2012 312 Discret. Math. 21 https://doi.org/10.1016/j.disc.2012.07.011 db/journals/dm/dm312.html#KubaP12

Markus Kuba Alois Panholzer Bilabelled increasing trees and hook-length formulae. 248-258 2012 33 Eur. J. Comb. 2 https://doi.org/10.1016/j.ejc.2011.09.043 db/journals/ejc/ejc33.html#KubaP12

Ahmed Helmi 0001 Alois Panholzer Analysis of "Hiring Above the Median": A "Lake Wobegon" Strategy for The Hiring Problem. 75-83 2012 ANALCO https://doi.org/10.1137/1.9781611973020.10 conf/analco/2012 db/conf/analco/analco2012.html#HelmiP12 Ahmed Helmi 0001 Conrado Martínez Alois Panholzer Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. 470-481 2012 LATIN https://doi.org/10.1007/978-3-642-29344-3_40 https://www.wikidata.org/entity/Q61734785 conf/latin/2012 db/conf/latin/latin2012.html#HelmiMP12

Markus Kuba Alois Panholzer Analysis of Statistics for Generalized Stirling Permutations. 875-910 2011 20 Comb. Probab. Comput. 6 https://doi.org/10.1017/S0963548311000381 db/journals/cpc/cpc20.html#KubaP11

Svante Janson Markus Kuba Alois Panholzer Generalized Stirling permutations, families of increasing trees and urn models. 94-114 2011 118 J. Comb. Theory A 1 https://doi.org/10.1016/j.jcta.2009.11.006 db/journals/jct/jcta118.html#JansonKP11

Conrado Martínez Alois Panholzer Helmut Prodinger The analysis of Range Quickselect and related problems. 6537-6555 2011 412 Theor. Comput. Sci. 46 https://doi.org/10.1016/j.tcs.2011.06.030 https://www.wikidata.org/entity/Q38881243 db/journals/tcs/tcs412.html#MartinezPP11

Markus Kuba Alois Panholzer On the area under lattice paths associated with triangular diminishing urn models. 329-358 2010 44 Adv. Appl. Math. 4 https://doi.org/10.1016/j.aam.2009.09.001 db/journals/aam/aam44.html#KubaP10

Markus Kuba Alois Panholzer On the distribution of distances between specified nodes in increasing trees. 489-506 2010 158 Discret. Appl. Math. 5 https://doi.org/10.1016/j.dam.2009.10.014 db/journals/dam/dam158.html#KubaP10

Markus Kuba Alois Panholzer Enumeration results for alternating tree families. 1751-1780 2010 31 Eur. J. Comb. 7 https://doi.org/10.1016/j.ejc.2010.03.001 db/journals/ejc/ejc31.html#KubaP10

Markus Kuba Alois Panholzer A combinatorial approach to the analysis of bucket recursive trees. 3255-3273 2010 411 Theor. Comput. Sci. 34-36 https://doi.org/10.1016/j.tcs.2010.05.030 db/journals/tcs/tcs411.html#KubaP10

Markus Kuba Alois Panholzer Helmut Prodinger Lattice Paths, Sampling Without Replacement, and Limiting Distributions. 2009 16 Electron. J. Comb. 1 https://doi.org/10.37236/156 db/journals/combinatorics/combinatorics16.html#KubaPP09

Cyril Banderier Markus Kuba Alois Panholzer Analysis of three graph parameters for random trees. 42-69 2009 35 Random Struct. Algorithms 1 https://doi.org/10.1002/rsa.20259 db/journals/rsa/rsa35.html#BanderierKP09

Alois Panholzer A distributional study of the path edge-covering numbers for random trees. 1036-1052 2008 156 Discret. Appl. Math. 7 https://doi.org/10.1016/j.dam.2006.05.014 db/journals/dam/dam156.html#Panholzer08

Markus Kuba Alois Panholzer On edge-weighted recursive trees and inversions in random permutations. 529-540 2008 308 Discret. Math. 4 https://doi.org/10.1016/j.disc.2007.03.032 db/journals/dm/dm308.html#KubaP08

Alois Panholzer Analysis of Some Parameters for Random Nodes in Priority Trees. 2008 10 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.46298/dmtcs.447 db/journals/dmtcs/dmtcs10.html#Panholzer08

Qunqiang Feng Hosam M. Mahmoud Alois Panholzer Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees. 160-184 2008 22 SIAM J. Discret. Math. 1 https://doi.org/10.1137/060653950 db/journals/siamdm/siamdm22.html#FengMP08

Conrado Martínez Alois Panholzer Helmut Prodinger Generating Random Derangements. 234-240 2008 ANALCO https://doi.org/10.1137/1.9781611972986.7 conf/analco/2008 db/conf/analco/analco2008.html#MartinezPP08

Markus Kuba Alois Panholzer On the degree distribution of the nodes in increasing trees. 597-618 2007 114 J. Comb. Theory A 4 https://doi.org/10.1016/j.jcta.2006.08.003 db/journals/jct/jcta114.html#KubaP07

Alois Panholzer Helmut Prodinger Level of nodes in increasing trees revisited. 203-226 2007 31 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.20161 db/journals/rsa/rsa31.html#PanholzerP07

Markus Kuba Alois Panholzer The left-right-imbalance of binary search trees. 265-278 2007 370 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/j.tcs.2006.10.033 db/journals/tcs/tcs370.html#KubaP07

Markus Kuba Alois Panholzer Analysis of Insertion Costs in Priority Trees. 175-182 2007 ANALCO https://doi.org/10.1137/1.9781611972979.2 conf/analco/2007 db/conf/analco/analco2007.html#KubaP07

James Allen Fill Nevin Kapur Alois Panholzer Destruction of Very Simple Trees. 345-366 2006 46 Algorithmica 3-4 https://doi.org/10.1007/s00453-006-0100-1 db/journals/algorithmica/algorithmica46.html#FillKP06

Markus Kuba Alois Panholzer Descendants in Increasing Trees. 2006 13 Electron. J. Comb. 1 https://doi.org/10.37236/1034 db/journals/combinatorics/combinatorics13.html#KubaP06

Alois Panholzer The distribution of the path edge-covering numbers for random trees. 163-169 2005 19 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2005.05.023 db/journals/endm/endm19.html#Panholzer05

Alois Panholzer Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function. 79-97 2005 10 J. Autom. Lang. Comb. 1 db/journals/jalc/jalc10.html#Panholzer05 https://doi.org/10.25596/jalc-2005-079

Alois Panholzer The climbing depth of random trees. 84-109 2005 26 Random Struct. Algorithms 1-2 https://doi.org/10.1002/rsa.20047 db/journals/rsa/rsa26.html#Panholzer05

Kate Morris Alois Panholzer Helmut Prodinger On Some Parameters in Heap Ordered Trees. 677-696 2004 13 Comb. Probab. Comput. 4-5 https://doi.org/10.1017/S0963548304006194 db/journals/cpc/cpc13.html#MorrisPP04

Alois Panholzer Distribution of the Steiner Distance in Generalized M-ary Search Trees. 717-733 2004 13 Comb. Probab. Comput. 4-5 https://doi.org/10.1017/S0963548304006212 db/journals/cpc/cpc13.html#Panholzer04

Alois Panholzer Helmut Prodinger Analysis of some statistics for increasing tree families. 437-460 2004 6 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.46298/dmtcs.326 db/journals/dmtcs/dmtcs6.html#PanholzerP04

Alois Panholzer Helmut Prodinger Marko Riedel Permuting in place: analysis of two stopping rules. 170-184 2004 51 J. Algorithms 2 https://doi.org/10.1016/j.jalgor.2004.01.003 db/journals/jal/jal51.html#PanholzerPR04

Alois Panholzer The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. 179-207 2004 25 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.20027 db/journals/rsa/rsa25.html#Panholzer04

Alois Panholzer The Height Distribution of Nodes in Non-Crossing Trees. 2003 69 Ars Comb. db/journals/arscom/arscom69.html#Panholzer03

Alois Panholzer Analysis of multiple quickselect variants. 45-91 2003 302 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/S0304-3975(02)00729-6 db/journals/tcs/tcs302.html#Panholzer03

Alois Panholzer Non-crossing trees revisited: cutting down and spanning subtrees. 265-276 2003 conf/drw/2003 DRW http://dmtcs.episciences.org/3327 db/conf/drw/drw2003.html#Panholzer03

Alois Panholzer Helmut Prodinger Bijections for ternary trees and non-crossing trees. 181-195 2002 250 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(01)00282-5 https://www.wikidata.org/entity/Q127087532 db/journals/dm/dm250.html#PanholzerP02

Jean-François Marckert Alois Panholzer Noncrossing trees are almost conditioned Galton-Watson trees. 115-125 2002 20 Random Struct. Algorithms 1 db/journals/rsa/rsa20.html#MarckertP02 https://doi.org/10.1002/rsa.10016

Conrado Martinez Alois Panholzer Helmut Prodinger Partial Match Queries in Relaxed Multidimensional Search Trees. 181-204 2001 29 Algorithmica 1 https://doi.org/10.1007/BF02679618 https://www.wikidata.org/entity/Q61734811 db/journals/algorithmica/algorithmica29.html#MartinezPP01

Alois Panholzer Untersuchungen zur durchschnittlichen Gestalt gewisser Baumfamilien: mit besonderer Berücksichtigung von Anwendungen in der Informatik. 1999 1-219 Österr. Kunst- und Kulturverl. Vienna University of Technology, Austria 978-3-85437-176-2 https://d-nb.info/956331319

Alois Panholzer Helmut Prodinger Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. 600-630 1998 22 Algorithmica 4 https://doi.org/10.1007/PL00009243 db/journals/algorithmica/algorithmica22.html#PanholzerP98

Alois Panholzer Helmut Prodinger Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial. 201-204 1998 41 Comput. J. 3 db/journals/cj/cj41.html#PanholzerP98 https://doi.org/10.1093/comjnl/41.3.201

Conrado Martinez Alois Panholzer Helmut Prodinger On the Number of Descendants and Ascendants in Random Search Trees. 1998 5 Electron. J. Comb. https://doi.org/10.37236/1358 db/journals/combinatorics/combinatorics5.html#MartinezPP98

Alois Panholzer Helmut Prodinger A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. 189-209 1998 13 Random Struct. Algorithms 3-4 db/journals/rsa/rsa13.html#PanholzerP98 https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4<189::AID-RSA1>3.0.CO;2-R

Alois Panholzer Helmut Prodinger Descendants and ascendants in binary trees. 247-266 1997 1 Discret. Math. Theor. Comput. Sci. 2 https://doi.org/10.46298/dmtcs.246 db/journals/dmtcs/dmtcs1.html#PanholzerP97

Cyril Banderier Marie-Louise BrunerMarie-Louise Lackner Wei-Mei Chen Qunqiang Feng James Allen Fill Benjamin Hackl Ahmed Helmi 0001 Hsien-Kuei Hwang Svante Janson Nevin Kapur Markus Kuba Hosam M. Mahmoud Jean-François Marckert Conrado MartínezConrado Martinez Kate Morris Helmut Prodinger Marko Riedel Nicolas Rolin Georg Seitz Tsung-Hsi Tsai Stephan G. WagnerStephan Wagner 0003