Alois Panholzer

From MaRDI portal
Revision as of 13:59, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Alois Panholzer to Alois Panholzer: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:285057

Available identifiers

zbMath Open panholzer.aloisWikidataQ102365320 ScholiaQ102365320MaRDI QIDQ285057

List of research outcomes





PublicationDate of PublicationType
Uncovering a random tree2024-05-14Paper
On card guessing games: limit law for no feedback one-time riffle shuffle2024-03-21Paper
On Card guessing games: limit law for one-time riffle shuffle2023-06-28Paper
Tree evolution processes for bucket increasing trees2023-05-15Paper
On bucket increasing trees, clustered increasing trees and increasing diamonds2023-03-31Paper
On Card guessing with two types of cards2023-03-08Paper
A note on the limit law of one-sided tree destruction2023-01-10Paper
Analysis of some exactly solvable diminishing urn models2022-12-09Paper
Parking function varieties for combinatorial tree models2021-06-28Paper
Consecutive permutation patterns in trees and mappings2021-02-08Paper
Runs in labelled trees and mappings2020-07-08Paper
A combinatorial approach for discrete car parking on random labelled trees2020-03-20Paper
Combinatorial Analysis of Growth Models for Series-Parallel Networks2020-03-11Paper
https://portal.mardi4nfdi.de/entity/Q51975952019-09-19Paper
Analysis of “hiring above the median”: a “Lake Wobegon” strategy for the hiring problem2019-09-17Paper
Analysis of insertion costs in priority trees2019-09-16Paper
Generating Random Derangements2019-09-16Paper
A note on harmonic number identities, Stirling series and multiple zeta values2019-07-25Paper
Combinatorial analysis of growth models for series-parallel networks2019-04-29Paper
https://portal.mardi4nfdi.de/entity/Q45840282018-08-29Paper
https://portal.mardi4nfdi.de/entity/Q29598592017-02-10Paper
Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model2017-02-10Paper
https://portal.mardi4nfdi.de/entity/Q28343362016-11-28Paper
On moment sequences and mixed Poisson distributions2016-09-21Paper
Parking functions for mappings2016-05-18Paper
Combinatorial families of multilabelled increasing trees and hook-length formulas2015-10-08Paper
Alternating mapping functions2015-06-19Paper
Analysis of the strategy ``hiring above the \(m\)-th best candidate2015-01-19Paper
On death processes and urn models2014-09-29Paper
Probabilistic analysis of the (1+1)-evolutionary algorithm2014-09-17Paper
Multiple isolation of nodes in recursive trees2014-09-05Paper
Ancestors and descendants in evolving k‐tree models2014-08-07Paper
Analysis of a generalized Friedman's urn with multiple drawings2014-04-23Paper
A unifying approach for proving hook-length formulas for weighted tree families2014-02-14Paper
Analysis of the ``hiring above the median selection strategy for the hiring problem2013-11-11Paper
Limiting distributions for the number of inversions in labelled tree families2013-01-09Paper
Enumeration formulæ for pattern restricted Stirling permutations2012-10-16Paper
Hiring above the m-th Best Candidate: A Generalization of Records in Permutations2012-06-29Paper
ASYMPTOTIC RESULTS FOR THE NUMBER OF PATHS IN A GRID2012-06-18Paper
Limiting Distributions for a Class Of Diminishing Urn Models2012-04-10Paper
Left and right length of paths in binary trees or on a question of Knuth2012-01-24Paper
Bilabelled increasing trees and hook-length formulae2012-01-11Paper
Analysis of Statistics for Generalized Stirling Permutations2011-12-08Paper
The analysis of range quickselect and related problems2011-12-07Paper
https://portal.mardi4nfdi.de/entity/Q30820052011-03-09Paper
Generalized Stirling permutations, families of increasing trees and urn models2011-01-07Paper
Analysis of three graph parameters for random trees2010-11-09Paper
Enumeration results for alternating tree families2010-10-18Paper
A combinatorial approach to the analysis of bucket recursive trees2010-08-11Paper
https://portal.mardi4nfdi.de/entity/Q35767692010-08-02Paper
https://portal.mardi4nfdi.de/entity/Q35767762010-08-02Paper
https://portal.mardi4nfdi.de/entity/Q35750032010-07-05Paper
https://portal.mardi4nfdi.de/entity/Q35750162010-07-05Paper
On the distribution of distances between specified nodes in increasing trees2010-05-05Paper
On the area under lattice paths associated with triangular diminishing urn models2010-04-01Paper
A Short Proof of a Series Evaluation in Terms of Harmonic Numbers2010-01-06Paper
Bijections between certain families of labelled and unlabelled d-ary trees2009-12-04Paper
Lattice paths, sampling without replacement, and limiting distributions2009-07-08Paper
A Combinatorial Approach for Analyzing the Number of Descendants in Increasing Trees and Related Parameters2009-07-02Paper
On the shape of the fringe of various types of random trees2009-06-25Paper
Limit laws for the Randić index of random binary tree models2009-06-02Paper
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees2009-03-16Paper
Isolating nodes in recursive trees2009-01-29Paper
Isolating a leaf in rooted trees via random cuttings2008-08-18Paper
https://portal.mardi4nfdi.de/entity/Q53877372008-05-27Paper
A distributional study of the path edge-covering numbers for random trees2008-04-16Paper
On edge-weighted recursive trees and inversions in random permutations2008-01-28Paper
Level of nodes in increasing trees revisited2008-01-08Paper
ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES2007-10-26Paper
https://portal.mardi4nfdi.de/entity/Q52939662007-07-05Paper
https://portal.mardi4nfdi.de/entity/Q34396792007-05-29Paper
On the degree distribution of the nodes in increasing trees2007-05-10Paper
Cutting down very simple trees2007-04-13Paper
The left-right-imbalance of binary search trees2007-02-26Paper
Destruction of very simple trees2007-02-14Paper
https://portal.mardi4nfdi.de/entity/Q54853292006-08-29Paper
Computer-free evaluation of an infinite double sum via Euler sums2006-03-20Paper
https://portal.mardi4nfdi.de/entity/Q33700102006-02-06Paper
Descendants in increasing trees2006-01-31Paper
https://portal.mardi4nfdi.de/entity/Q54660172005-08-23Paper
The climbing depth of random trees2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q46676172005-04-20Paper
On Some Parameters in Heap Ordered Trees2005-04-18Paper
Distribution of the Steiner Distance in Generalized M-ary Search Trees2005-04-18Paper
https://portal.mardi4nfdi.de/entity/Q31546892005-01-14Paper
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees2005-01-12Paper
Spanning tree size in random binary search trees.2004-09-15Paper
Permuting in place: analysis of two stopping rules2004-08-06Paper
On generalized Fibonacci permutations2004-06-14Paper
https://portal.mardi4nfdi.de/entity/Q44510562004-02-22Paper
Analysis of multiple quickselect variants.2003-08-17Paper
Noncrossing trees are almost conditioned Galton–Watson trees2003-01-09Paper
Bijections for ternary trees and non-crossing trees2002-08-29Paper
Binary search tree recursions with harmonic toll functions2002-08-22Paper
Moments of level numbers of leaves in binary trees2002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27843392002-04-23Paper
Partial match queries in relaxed multidimensional search trees2001-09-03Paper
https://portal.mardi4nfdi.de/entity/Q27339672001-08-13Paper
https://portal.mardi4nfdi.de/entity/Q44889562001-05-20Paper
An analytic approach for the analysis of rotations in fringe-balanced binary search trees2000-05-18Paper
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT1999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q38365141999-12-09Paper
https://portal.mardi4nfdi.de/entity/Q42582211999-09-01Paper
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial1999-06-02Paper
Average-case analysis of priority trees: A structure of priority queue administration1999-02-02Paper
On the number of descendants and ascendants in random search trees1998-04-16Paper

Research outcomes over time

This page was built for person: Alois Panholzer