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