Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. - Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (Algorithmica, 2006)

Invariance principles for Diophantine approximation of formal Laurent series over a finite base field. - Eveyth Deligero; Michael Fuchs 001; Hitoshi Nakada (Finite Fields Their Appl., 2007)

Phase changes in random point quadtrees. - Hua-Huai Chern; Michael Fuchs 001; Hsien-Kuei Hwang (ACM Trans. Algorithms, 2007)

Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations. - Michael Fuchs 001 (Comb. Probab. Comput., 2008)

Asymptotic variance of random symmetric digital search trees. - Hsien-Kuei Hwang; Michael Fuchs 001; Vytas Zacharovas (Discret. Math. Theor. Comput. Sci., 2010)

The Subtree Size Profile of Plane-oriented Recursive Trees. - Michael Fuchs 001 (ANALCO, 2011)

Limit Theorems for Subtree Size Profiles of Increasing Trees. - Michael Fuchs 001 (Comb. Probab. Comput., 2012)

A higher-dimensional Kurzweil theorem for formal Laurent series over finite fields. - Shu-Yi Chen; Michael Fuchs 001 (Finite Fields Their Appl., 2012)

A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries. - Michael Fuchs 001; Chung-Kuei Lee (Electron. J. Comb., 2014)

A Binomial Splitting Process in Connection with Corner Parking Problems. - Michael Fuchs 001; Hsien-Kuei Hwang; Yoshiaki Itoh 002; Hosam M. Mahmoud (J. Appl. Probab., 2014)

An analytic approach to the asymptotic variance of trie statistics and related structures. - Michael Fuchs 001; Hsien-Kuei Hwang; Vytas Zacharovas (Theor. Comput. Sci., 2014)

A note on the quicksort asymptotics. - Michael Fuchs 001 (Random Struct. Algorithms, 2015)

The Wiener Index of Random Digital Trees. - Michael Fuchs 001; Chung-Kuei Lee (SIAM J. Discret. Math., 2015)

Dependence between External Path-Length and Size in Random Tries. - Michael Fuchs 001; Hsien-Kuei Hwang (CoRR, 2016)

On 2-protected nodes in random digital trees. - Michael Fuchs 001; C.-K. Lee; G.-R. Yu (Theor. Comput. Sci., 2016)

External Profile of Symmetric Digital Search Trees (Extended Abstract). - Michael Drmota; Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (ANALCO, 2017)

Dependence between path-length and size in random digital trees. - Michael Fuchs 001; Hsien-Kuei Hwang (J. Appl. Probab., 2017)

From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader. - Michael Fuchs 001; Hsien-Kuei Hwang; Yoshiaki Itoh 002 (J. Appl. Probab., 2017)

Dependence and phase changes in random m-ary search trees. - Hua-Huai Chern; Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (Random Struct. Algorithms, 2017)

Refined Asymptotics for the Number of Leaves of Random Point Quadtrees. - Michael Fuchs 001; Noela S. Müller; Henning Sulzbach (AofA, 2018)

Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks. - Michael Fuchs 001; Bernhard Gittenberger; Marefatollah Mansouri (Australas. J Comb., 2019)

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. - Michael Fuchs 001; Cecilia Holmgren; Dieter Mitsche; Ralph Neininger (Discret. Appl. Math., 2021)

On the asymptotic growth of the number of tree-child networks. - Michael Fuchs 001; Guan-Ru Yu; Louxin Zhang (Eur. J. Comb., 2021)

Node profiles of symmetric digital search trees: Concentration properties. - Michael Drmota; Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (Random Struct. Algorithms, 2021)

Enumeration of d-Combining Tree-Child Networks. - Yu-Sheng Chang; Michael Fuchs 001; Hexuan Liu; Michael Wallner 001; Guan-Ru Yu (AofA, 2022)

Counting phylogenetic networks with few reticulation vertices: A second approach. - Michael Fuchs 001; En-Yu Huang; Guan-Ru Yu (Discret. Appl. Math., 2022)

Bijections for ranked tree-child networks. - Alessandra Caraceni; Michael Fuchs 001; Guan-Ru Yu (Discret. Math., 2022)

Asymptotic enumeration and distributional properties of galled networks. - Michael Fuchs 001; Guan-Ru Yu; Louxin Zhang (J. Comb. Theory A, 2022)

Distribution of External Branch Lengths in Yule Histories. - Filippo Disanto; Michael Fuchs 001 (Electron. J. Comb., 2023)

Asymptotic normality for the size of graph tries built from M-ary tree labelings. - Michael Fuchs 001; Tsan-Cheng Yu (Theor. Comput. Sci., 2023)

Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls. - Lily Agranat-Tamir; Michael Fuchs 001; Bernhard Gittenberger; Noah A. Rosenberg (AofA, 2024)

Galled Tree-Child Networks. - Yu-Sheng Chang; Michael Fuchs 001; Guan-Ru Yu (AofA, 2024)

Enumerative and distributional results for d-combining tree-child networks. - Yu-Sheng Chang; Michael Fuchs 001; Hexuan Liu; Michael Wallner 001; Guan-Ru Yu (Adv. Appl. Math., 2024)

The distributions under two species-tree models of the total number of ancestral configurations for matching gene trees and species trees. - Filippo Disanto; Michael Fuchs 001; Chun-Yen Huang; Ariel R. Paningbatan; Noah A. Rosenberg (Adv. Appl. Math., 2024)

Limit theorems for patterns in ranked tree-child networks. - Michael Fuchs 001; Hexuan Liu; Tsan-Cheng Yu (Random Struct. Algorithms, 2024)