Michael Fuchs

Hexuan Liu

Tsan-Cheng Yu

Random Struct. Algorithms, January, 2024

The distributions under two species-tree models of the total number of ancestral configurations for matching gene trees and species trees.

[BibT_eX]

[DOI]

Adv. Appl. Math., January, 2024

Enumerative and distributional results for d-combining tree-child networks.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2024

Galled Tree-Child Networks.

[BibT_eX]

[DOI]

Yu-Sheng Chang

Proceedings of the 35th International Conference on Probabilistic, 2024

Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls.

[BibT_eX]

[DOI]

Lily Agranat-Tamir

Bernhard Gittenberger

Noah A. Rosenberg

Proceedings of the 35th International Conference on Probabilistic, 2024

2023

Asymptotic normality for the size of graph tries built from M-ary tree labelings.

[BibT_eX]

[DOI]

Tsan-Cheng Yu

Theor. Comput. Sci., August, 2023

Distribution of External Branch Lengths in Yule Histories.

[BibT_eX]

[DOI]

Filippo Disanto

Electron. J. Comb., 2023

2022

Asymptotic enumeration and distributional properties of galled networks.

[BibT_eX]

[DOI]

Louxin Zhang

J. Comb. Theory A, 2022

Bijections for ranked tree-child networks.

[BibT_eX]

[DOI]

Alessandra Caraceni

Discret. Math., 2022

Counting phylogenetic networks with few reticulation vertices: A second approach.

[BibT_eX]

[DOI]

En-Yu Huang

Discret. Appl. Math., 2022

Enumeration of d-Combining Tree-Child Networks.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

Node profiles of symmetric digital search trees: Concentration properties.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2021

On the asymptotic growth of the number of tree-child networks.

[BibT_eX]

[DOI]

Louxin Zhang

Eur. J. Comb., 2021

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2019

Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks.

[BibT_eX]

[DOI]

Bernhard Gittenberger

Marefatollah Mansouri

Australas. J Comb., 2019

2018

Refined Asymptotics for the Number of Leaves of Random Point Quadtrees.

[BibT_eX]

[DOI]

Noela S. Müller

Henning Sulzbach

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Dependence and phase changes in random <i>m</i>-ary search trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader.

[BibT_eX]

[DOI]

Yoshiaki Itoh

J. Appl. Probab., 2017

Dependence between path-length and size in random digital trees.

[BibT_eX]

[DOI]

J. Appl. Probab., 2017

External Profile of Symmetric Digital Search Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

On 2-protected nodes in random digital trees.

[BibT_eX]

[DOI]

C.-K. Lee

G.-R. Yu

Theor. Comput. Sci., 2016

Dependence between External Path-Length and Size in Random Tries.

[BibT_eX]

[DOI]

CoRR, 2016

2015

The Wiener Index of Random Digital Trees.

[BibT_eX]

[DOI]

Chung-Kuei Lee

SIAM J. Discret. Math., 2015

A note on the quicksort asymptotics.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

2014

An analytic approach to the asymptotic variance of trie statistics and related structures.

[BibT_eX]

[DOI]

Vytas Zacharovas

Theor. Comput. Sci., 2014

A Binomial Splitting Process in Connection with Corner Parking Problems.

[BibT_eX]

[DOI]

J. Appl. Probab., 2014

A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries.

[BibT_eX]

[DOI]

Chung-Kuei Lee

Electron. J. Comb., 2014

2012

A higher-dimensional Kurzweil theorem for formal Laurent series over finite fields.

[BibT_eX]

[DOI]

Shu-Yi Chen

Finite Fields Their Appl., 2012

Limit Theorems for Subtree Size Profiles of Increasing Trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

2011

The Subtree Size Profile of Plane-oriented Recursive Trees.

[BibT_eX]

[DOI]

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010

Asymptotic variance of random symmetric digital search trees.

[BibT_eX]

[DOI]

Vytas Zacharovas

Discret. Math. Theor. Comput. Sci., 2010

2008

Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

2007

Phase changes in random point quadtrees.

[BibT_eX]

[DOI]

Hua-Huai Chern

ACM Trans. Algorithms, 2007

Invariance principles for Diophantine approximation of formal Laurent series over a finite base field.

[BibT_eX]

[DOI]

Eveyth Deligero

Hitoshi Nakada

Finite Fields Their Appl., 2007

2006

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees.

[BibT_eX]

[DOI]