| Publication | Date of Publication | Type |
|---|
| On card guessing games: limit law for no feedback one-time riffle shuffle | 2024-03-21 | Paper |
| On Card guessing games: limit law for one-time riffle shuffle | 2023-06-28 | Paper |
| Tree evolution processes for bucket increasing trees | 2023-05-15 | Paper |
| On bucket increasing trees, clustered increasing trees and increasing diamonds | 2023-03-31 | Paper |
| On Card guessing with two types of cards | 2023-03-08 | Paper |
| A note on the limit law of one-sided tree destruction | 2023-01-10 | Paper |
| Analysis of some exactly solvable diminishing urn models | 2022-12-09 | Paper |
| Parking function varieties for combinatorial tree models | 2021-06-28 | Paper |
| Consecutive permutation patterns in trees and mappings | 2021-02-08 | Paper |
| Runs in labelled trees and mappings | 2020-07-08 | Paper |
| A combinatorial approach for discrete car parking on random labelled trees | 2020-03-20 | Paper |
| Combinatorial Analysis of Growth Models for Series-Parallel Networks | 2020-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5197595 | 2019-09-19 | Paper |
| Analysis of “hiring above the median”: a “Lake Wobegon” strategy for the hiring problem | 2019-09-17 | Paper |
| Analysis of insertion costs in priority trees | 2019-09-16 | Paper |
| Generating Random Derangements | 2019-09-16 | Paper |
| A note on harmonic number identities, Stirling series and multiple zeta values | 2019-07-25 | Paper |
| Combinatorial analysis of growth models for series-parallel networks | 2019-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584028 | 2018-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959859 | 2017-02-10 | Paper |
| Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2834336 | 2016-11-28 | Paper |
| On moment sequences and mixed Poisson distributions | 2016-09-21 | Paper |
| Parking functions for mappings | 2016-05-18 | Paper |
| Combinatorial families of multilabelled increasing trees and hook-length formulas | 2015-10-08 | Paper |
| Alternating mapping functions | 2015-06-19 | Paper |
| Analysis of the strategy ``hiring above the \(m\)-th best candidate | 2015-01-19 | Paper |
| On death processes and urn models | 2014-09-29 | Paper |
| Probabilistic analysis of the (1+1)-evolutionary algorithm | 2014-09-17 | Paper |
| Multiple isolation of nodes in recursive trees | 2014-09-05 | Paper |
| Ancestors and descendants in evolving k‐tree models | 2014-08-07 | Paper |
| Analysis of a generalized Friedman's urn with multiple drawings | 2014-04-23 | Paper |
| A unifying approach for proving hook-length formulas for weighted tree families | 2014-02-14 | Paper |
| Analysis of the ``hiring above the median selection strategy for the hiring problem | 2013-11-11 | Paper |
| Limiting distributions for the number of inversions in labelled tree families | 2013-01-09 | Paper |
| Enumeration formulæ for pattern restricted Stirling permutations | 2012-10-16 | Paper |
| Hiring above the m-th Best Candidate: A Generalization of Records in Permutations | 2012-06-29 | Paper |
| ASYMPTOTIC RESULTS FOR THE NUMBER OF PATHS IN A GRID | 2012-06-18 | Paper |
| Limiting Distributions for a Class Of Diminishing Urn Models | 2012-04-10 | Paper |
| Left and right length of paths in binary trees or on a question of Knuth | 2012-01-24 | Paper |
| Bilabelled increasing trees and hook-length formulae | 2012-01-11 | Paper |
| Analysis of Statistics for Generalized Stirling Permutations | 2011-12-08 | Paper |
| The analysis of range quickselect and related problems | 2011-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3082005 | 2011-03-09 | Paper |
| Generalized Stirling permutations, families of increasing trees and urn models | 2011-01-07 | Paper |
| Analysis of three graph parameters for random trees | 2010-11-09 | Paper |
| Enumeration results for alternating tree families | 2010-10-18 | Paper |
| A combinatorial approach to the analysis of bucket recursive trees | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576769 | 2010-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576776 | 2010-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575003 | 2010-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575016 | 2010-07-05 | Paper |
| On the distribution of distances between specified nodes in increasing trees | 2010-05-05 | Paper |
| On the area under lattice paths associated with triangular diminishing urn models | 2010-04-01 | Paper |
| A Short Proof of a Series Evaluation in Terms of Harmonic Numbers | 2010-01-06 | Paper |
| Bijections between certain families of labelled and unlabelled d-ary trees | 2009-12-04 | Paper |
| Lattice paths, sampling without replacement, and limiting distributions | 2009-07-08 | Paper |
| A Combinatorial Approach for Analyzing the Number of Descendants in Increasing Trees and Related Parameters | 2009-07-02 | Paper |
| On the shape of the fringe of various types of random trees | 2009-06-25 | Paper |
| Limit laws for the Randić index of random binary tree models | 2009-06-02 | Paper |
| Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees | 2009-03-16 | Paper |
| Isolating nodes in recursive trees | 2009-01-29 | Paper |
| Isolating a leaf in rooted trees via random cuttings | 2008-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387737 | 2008-05-27 | Paper |
| A distributional study of the path edge-covering numbers for random trees | 2008-04-16 | Paper |
| On edge-weighted recursive trees and inversions in random permutations | 2008-01-28 | Paper |
| Level of nodes in increasing trees revisited | 2008-01-08 | Paper |
| ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES | 2007-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5293966 | 2007-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439679 | 2007-05-29 | Paper |
| On the degree distribution of the nodes in increasing trees | 2007-05-10 | Paper |
| Cutting down very simple trees | 2007-04-13 | Paper |
| The left-right-imbalance of binary search trees | 2007-02-26 | Paper |
| Destruction of very simple trees | 2007-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485329 | 2006-08-29 | Paper |
| Computer-free evaluation of an infinite double sum via Euler sums | 2006-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3370010 | 2006-02-06 | Paper |
| Descendants in increasing trees | 2006-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466017 | 2005-08-23 | Paper |
| The climbing depth of random trees | 2005-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667617 | 2005-04-20 | Paper |
| On Some Parameters in Heap Ordered Trees | 2005-04-18 | Paper |
| Distribution of the Steiner Distance in Generalized M-ary Search Trees | 2005-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154689 | 2005-01-14 | Paper |
| The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees | 2005-01-12 | Paper |
| Spanning tree size in random binary search trees. | 2004-09-15 | Paper |
| Permuting in place: analysis of two stopping rules | 2004-08-06 | Paper |
| On generalized Fibonacci permutations | 2004-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451056 | 2004-02-22 | Paper |
| Analysis of multiple quickselect variants. | 2003-08-17 | Paper |
| Noncrossing trees are almost conditioned Galton–Watson trees | 2003-01-09 | Paper |
| Bijections for ternary trees and non-crossing trees | 2002-08-29 | Paper |
| Binary search tree recursions with harmonic toll functions | 2002-08-22 | Paper |
| Moments of level numbers of leaves in binary trees | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2784339 | 2002-04-23 | Paper |
| Partial match queries in relaxed multidimensional search trees | 2001-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2733967 | 2001-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488956 | 2001-05-20 | Paper |
| An analytic approach for the analysis of rotations in fringe-balanced binary search trees | 2000-05-18 | Paper |
| A generating functions approach for the analysis of grand averages for multiple QUICKSELECT | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836514 | 1999-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258221 | 1999-09-01 | Paper |
| Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial | 1999-06-02 | Paper |
| Average-case analysis of priority trees: A structure of priority queue administration | 1999-02-02 | Paper |
| On the number of descendants and ascendants in random search trees | 1998-04-16 | Paper |
