Alois Panholzer

Adv. Appl. Math., 2024

2023

Tree evolution processes for bucket increasing trees.

[BibT_eX]

[DOI]

Discret. Math., July, 2023

2022

On bucket increasing trees, clustered increasing trees and increasing diamonds.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

Uncovering a Random Tree.

[BibT_eX]

[DOI]

Benjamin Hackl

Stephan Wagner

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Parking function varieties for combinatorial tree models.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

2020

A combinatorial approach for discrete car parking on random labelled trees.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

Runs in labelled trees and mappings.

[BibT_eX]

[DOI]

Marie-Louise Lackner

Discret. Math., 2020

2019

Combinatorial Analysis of Growth Models for Series-Parallel Networks.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

Stirling permutations containing a single pattern of length three.

[BibT_eX]

[DOI]

Australas. J Comb., 2019

2018

Probabilistic Analysis of the (1+1)-Evolutionary Algorithm.

[BibT_eX]

[DOI]

Evol. Comput., 2018

2016

Parking functions for mappings.

[BibT_eX]

[DOI]

Marie-Louise Lackner

J. Comb. Theory A, 2016

Combinatorial families of multilabelled increasing trees and hook-length formulas.

[BibT_eX]

[DOI]

Discret. Math., 2016

2014

Ancestors and descendants in evolving <i>k</i>-tree models.

[BibT_eX]

[DOI]

Georg Seitz

Random Struct. Algorithms, 2014

Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate".

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Alternating mapping functions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Analysis of a generalized Friedman's urn with multiple drawings.

[BibT_eX]

[DOI]

Hosam M. Mahmoud

Discret. Appl. Math., 2013

Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem.

[BibT_eX]

[DOI]

Algorithmica, 2013

2012

Bilabelled increasing trees and hook-length formulae.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Enumeration formulæ for pattern restricted Stirling permutations.

[BibT_eX]

[DOI]

Discret. Math., 2012

Hiring above the m-th Best Candidate: A Generalization of Records in Permutations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Analysis of "Hiring Above the Median": A "Lake Wobegon" Strategy for The Hiring Problem.

[BibT_eX]

[DOI]

Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011

The analysis of Range Quickselect and related problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Generalized Stirling permutations, families of increasing trees and urn models.

[BibT_eX]

[DOI]

Svante Janson

J. Comb. Theory A, 2011

Analysis of Statistics for Generalized Stirling Permutations.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

2010

A combinatorial approach to the analysis of bucket recursive trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Enumeration results for alternating tree families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

On the distribution of distances between specified nodes in increasing trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

On the area under lattice paths associated with triangular diminishing urn models.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2010

2009

Analysis of three graph parameters for random trees.

[BibT_eX]

[DOI]

Cyril Banderier

Random Struct. Algorithms, 2009

Lattice Paths, Sampling Without Replacement, and Limiting Distributions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees.

[BibT_eX]

[DOI]

Qunqiang Feng

Hosam M. Mahmoud

SIAM J. Discret. Math., 2008

Analysis of Some Parameters for Random Nodes in Priority Trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2008

On edge-weighted recursive trees and inversions in random permutations.

[BibT_eX]

[DOI]

Discret. Math., 2008

A distributional study of the path edge-covering numbers for random trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Generating Random Derangements.

[BibT_eX]

[DOI]

Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007

The left-right-imbalance of binary search trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Level of nodes in increasing trees revisited.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

On the degree distribution of the nodes in increasing trees.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Analysis of Insertion Costs in Priority Trees.

[BibT_eX]

[DOI]

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006

Descendants in Increasing Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Destruction of Very Simple Trees.

[BibT_eX]

[DOI]

James Allen Fill

Nevin Kapur

Algorithmica, 2006

2005

The climbing depth of random trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

The distribution of the path edge-covering numbers for random trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Permuting in place: analysis of two stopping rules.

[BibT_eX]

[DOI]

Marko Riedel

J. Algorithms, 2004

Analysis of some statistics for increasing tree families.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2004

Distribution of the Steiner Distance in Generalized M-ary Search Trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

On Some Parameters in Heap Ordered Trees.

[BibT_eX]

[DOI]

Kate Morris

Comb. Probab. Comput., 2004

2003

Analysis of multiple quickselect variants.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The Height Distribution of Nodes in Non-Crossing Trees.

[BibT_eX]

Ars Comb., 2003

Non-crossing trees revisited: cutting down and spanning subtrees.

[BibT_eX]

[DOI]

Proceedings of the Discrete Random Walks, 2003

2002

Noncrossing trees are almost conditioned Galton-Watson trees.

[BibT_eX]

[DOI]

Jean-François Marckert

Random Struct. Algorithms, 2002

Bijections for ternary trees and non-crossing trees.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Partial Match Queries in Relaxed Multidimensional Search Trees.

[BibT_eX]

[DOI]

Conrado Martinez

Algorithmica, 2001

1999

Untersuchungen zur durchschnittlichen Gestalt gewisser Baumfamilien: mit besonderer Berücksichtigung von Anwendungen in der Informatik.

[BibT_eX]

[DOI]

PhD thesis, 1999

1998

A generating functions approach for the analysis of grand averages for multiple QUICKSELECT.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

On the Number of Descendants and Ascendants in Random Search Trees.

[BibT_eX]

[DOI]

Conrado Martinez

Electron. J. Comb., 1998

Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial.

[BibT_eX]

[DOI]

Comput. J., 1998

Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.

[BibT_eX]

[DOI]

Algorithmica, 1998

1997

Descendants and ascendants in binary trees.

[BibT_eX]

[DOI]