Alois Panholzer

From MaRDI portal
(Redirected from Person:285057)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Uncovering a random tree2024-05-14Paper
On card guessing games: limit law for no feedback one-time riffle shuffle
Advances in Applied Mathematics
2024-03-21Paper
On Card guessing games: limit law for one-time riffle shuffle2023-06-28Paper
Tree evolution processes for bucket increasing trees
Discrete Mathematics
2023-05-15Paper
On bucket increasing trees, clustered increasing trees and increasing diamonds
Combinatorics, Probability and Computing
2023-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 models
Advances in Applied Mathematics
2021-06-28Paper
Consecutive permutation patterns in trees and mappings
Journal of Combinatorics
2021-02-08Paper
Runs in labelled trees and mappings
Discrete Mathematics
2020-07-08Paper
A combinatorial approach for discrete car parking on random labelled trees
Journal of Combinatorial Theory. Series A
2020-03-20Paper
Combinatorial analysis of growth models for series-parallel networks
Combinatorics, Probability and Computing
2020-03-11Paper
scientific article; zbMATH DE number 7106992 (Why is no real title available?)2019-09-19Paper
Analysis of ``hiring above the median: a ``Lake Wobegon strategy for the hiring problem
2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-17Paper
Analysis of insertion costs in priority trees
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-16Paper
Generating random derangements
2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-16Paper
A note on harmonic number identities, Stirling series and multiple zeta values
International Journal of Number Theory
2019-07-25Paper
Combinatorial analysis of growth models for series-parallel networks
(available as arXiv preprint)
2019-04-29Paper
scientific article; zbMATH DE number 6928770 (Why is no real title available?)2018-08-29Paper
Ordered increasing \(k\)-trees: introduction and analysis of a preferential attachment network model2017-02-10Paper
Ordered increasing \(k\)-trees: introduction and analysis of a preferential attachment network model
(available as arXiv preprint)
2017-02-10Paper
The degree distribution of thickened trees2017-02-10Paper
Measuring post-quickselect disorder
Journal of the Iranian Statistical Society JIRSS
2016-11-28Paper
On moment sequences and mixed Poisson distributions
Probability Surveys
2016-09-21Paper
Parking functions for mappings
Journal of Combinatorial Theory. Series A
2016-05-18Paper
Combinatorial families of multilabelled increasing trees and hook-length formulas
Discrete Mathematics
2015-10-08Paper
Alternating mapping functions
Journal of Combinatorial Theory. Series A
2015-06-19Paper
Analysis of the strategy ``hiring above the \(m\)-th best candidate
Algorithmica
2015-01-19Paper
On death processes and urn models
(available as arXiv preprint)
2014-09-29Paper
On death processes and urn models2014-09-29Paper
Probabilistic analysis of the (1+1)-evolutionary algorithm2014-09-17Paper
Multiple isolation of nodes in recursive trees
Online Journal of Analytic Combinatorics
2014-09-05Paper
Multiple isolation of nodes in recursive trees
Online Journal of Analytic Combinatorics
2014-09-05Paper
Ancestors and descendants in evolving k‐tree models
Random Structures & Algorithms
2014-08-07Paper
Analysis of a generalized Friedman's urn with multiple drawings
Discrete Applied Mathematics
2014-04-23Paper
A unifying approach for proving hook-length formulas for weighted tree families
Graphs and Combinatorics
2014-02-14Paper
Analysis of the ``hiring above the median selection strategy for the hiring problem
Algorithmica
2013-11-11Paper
Limiting distributions for the number of inversions in labelled tree families
Annals of Combinatorics
2013-01-09Paper
Enumeration formulæ for pattern restricted Stirling permutations
Discrete Mathematics
2012-10-16Paper
Hiring above the \(m\)-th best candidate: a generalization of records in permutations
LATIN 2012: Theoretical Informatics
2012-06-29Paper
Asymptotic results for the number of paths in a grid
Bulletin of the Australian Mathematical Society
2012-06-18Paper
Limiting distributions for a class of diminishing urn models
Advances in Applied Probability
2012-04-10Paper
Left and right length of paths in binary trees or on a question of Knuth
Annals of Combinatorics
2012-01-24Paper
Bilabelled increasing trees and hook-length formulae
European Journal of Combinatorics
2012-01-11Paper
Analysis of statistics for generalized Stirling permutations
Combinatorics, Probability and Computing
2011-12-08Paper
The analysis of range quickselect and related problems
Theoretical Computer Science
2011-12-07Paper
Algorithms, random tree models and combinatorial objects2011-03-09Paper
Generalized Stirling permutations, families of increasing trees and urn models
Journal of Combinatorial Theory. Series A
2011-01-07Paper
Analysis of three graph parameters for random trees
Random Structures & Algorithms
2010-11-09Paper
Enumeration results for alternating tree families
European Journal of Combinatorics
2010-10-18Paper
A combinatorial approach to the analysis of bucket recursive trees
Theoretical Computer Science
2010-08-11Paper
scientific article; zbMATH DE number 5763329 (Why is no real title available?)2010-08-02Paper
Analysis of the total costs for variants of the union-find algorithm2010-08-02Paper
scientific article; zbMATH DE number 5730488 (Why is no real title available?)2010-07-05Paper
Left and right length of paths in binary trees2010-07-05Paper
On the distribution of distances between specified nodes in increasing trees
Discrete Applied Mathematics
2010-05-05Paper
On the area under lattice paths associated with triangular diminishing urn models
Advances in Applied Mathematics
2010-04-01Paper
A Short Proof of a Series Evaluation in Terms of Harmonic Numbers
Integers
2010-01-06Paper
Bijections between certain families of labelled and unlabelled d-ary trees
Applicable Analysis and Discrete Mathematics
2009-12-04Paper
Lattice paths, sampling without replacement, and limiting distributions
The Electronic Journal of Combinatorics
2009-07-08Paper
Lattice paths, sampling without replacement, and limiting distributions
The Electronic Journal of Combinatorics
2009-07-08Paper
A Combinatorial Approach for Analyzing the Number of Descendants in Increasing Trees and Related Parameters
Quaestiones Mathematicae
2009-07-02Paper
On the shape of the fringe of various types of random trees
Mathematical Methods in the Applied Sciences
2009-06-25Paper
Limit laws for the Randić index of random binary tree models
Annals of the Institute of Statistical Mathematics
2009-06-02Paper
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
SIAM Journal on Discrete Mathematics
2009-03-16Paper
Isolating nodes in recursive trees
Aequationes Mathematicae
2009-01-29Paper
Isolating a leaf in rooted trees via random cuttings
Annals of Combinatorics
2008-08-18Paper
Analysis of some parameters for random nodes in priority trees2008-05-27Paper
A distributional study of the path edge-covering numbers for random trees
Discrete Applied Mathematics
2008-04-16Paper
On edge-weighted recursive trees and inversions in random permutations
Discrete Mathematics
2008-01-28Paper
Level of nodes in increasing trees revisited
Random Structures & Algorithms
2008-01-08Paper
ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES
Probability in the Engineering and Informational Sciences
2007-10-26Paper
Mathematics for computer science2007-07-05Paper
scientific article; zbMATH DE number 5158499 (Why is no real title available?)2007-05-29Paper
On the degree distribution of the nodes in increasing trees
Journal of Combinatorial Theory. Series A
2007-05-10Paper
Cutting down very simple trees
Quaestiones Mathematicae
2007-04-13Paper
The left-right-imbalance of binary search trees
Theoretical Computer Science
2007-02-26Paper
Destruction of very simple trees
Algorithmica
2007-02-14Paper
Some results for monotonically labelled simply generated trees2006-08-29Paper
Computer-free evaluation of an infinite double sum via Euler sums
Séminaire Lotharingien de Combinatoire
2006-03-20Paper
Computer-free evaluation of an infinite double sum via Euler sums
Séminaire Lotharingien de Combinatoire
2006-03-20Paper
Gröbner bases and the defining polynomial of a context-free grammar generating function2006-02-06Paper
Descendants in increasing trees
The Electronic Journal of Combinatorics
2006-01-31Paper
Descendants in increasing trees
The Electronic Journal of Combinatorics
2006-01-31Paper
scientific article; zbMATH DE number 2197876 (Why is no real title available?)2005-08-23Paper
The climbing depth of random trees
Random Structures & Algorithms
2005-04-21Paper
scientific article; zbMATH DE number 2159651 (Why is no real title available?)2005-04-20Paper
scientific article; zbMATH DE number 2159651 (Why is no real title available?)2005-04-20Paper
On Some Parameters in Heap Ordered Trees
Combinatorics, Probability and Computing
2005-04-18Paper
Distribution of the Steiner Distance in Generalized M-ary Search Trees
Combinatorics, Probability and Computing
2005-04-18Paper
scientific article; zbMATH DE number 2127740 (Why is no real title available?)2005-01-14Paper
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
Random Structures & Algorithms
2005-01-12Paper
Spanning tree size in random binary search trees.
The Annals of Applied Probability
2004-09-15Paper
Permuting in place: analysis of two stopping rules
Journal of Algorithms
2004-08-06Paper
On generalized Fibonacci permutations
Journal of Information and Optimization Sciences
2004-06-14Paper
scientific article; zbMATH DE number 2046075 (Why is no real title available?)2004-02-22Paper
Analysis of multiple quickselect variants.
Theoretical Computer Science
2003-08-17Paper
Noncrossing trees are almost conditioned Galton–Watson trees
Random Structures & Algorithms
2003-01-09Paper
Bijections for ternary trees and non-crossing trees
Discrete Mathematics
2002-08-29Paper
Binary search tree recursions with harmonic toll functions
Journal of Computational and Applied Mathematics
2002-08-22Paper
Moments of level numbers of leaves in binary trees
Journal of Statistical Planning and Inference
2002-05-15Paper
A generating functions proof of a curious identity
Integers
2002-04-23Paper
Partial match queries in relaxed multidimensional search trees
Algorithmica
2001-09-03Paper
Kirkman's hypothesis revisited
Integers
2001-08-13Paper
Kirkman's hypothesis revisited
Integers
2001-08-13Paper
scientific article; zbMATH DE number 1471870 (Why is no real title available?)2001-05-20Paper
An analytic approach for the analysis of rotations in fringe-balanced binary search trees
Annals of Combinatorics
2000-05-18Paper
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT1999-12-19Paper
scientific article; zbMATH DE number 1375573 (Why is no real title available?)1999-12-09Paper
scientific article; zbMATH DE number 1375573 (Why is no real title available?)1999-12-09Paper
scientific article; zbMATH DE number 1330040 (Why is no real title available?)1999-09-01Paper
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial
The Computer Journal
1999-06-02Paper
Average-case analysis of priority trees: A structure of priority queue administration
Algorithmica
1999-02-02Paper
On the number of descendants and ascendants in random search trees
The Electronic Journal of Combinatorics
1998-04-16Paper


Research outcomes over time


This page was built for person: Alois Panholzer