Michael Fuchs

Orcid: 0000-0001-8891-6897

Affiliations:
  • National Chengchi University, Department of Mathematical Sciences, Taiwan
  • National Chiao Tung University, Department of Applied Mathematics, Hsinchu, Taiwan (2004 - 2019)
  • Vienna University of Technology, Austria (PhD 2002)


According to our database1, Michael Fuchs authored at least 35 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Limit theorems for patterns in ranked tree-child networks.
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.
Adv. Appl. Math., January, 2024

Enumerative and distributional results for d-combining tree-child networks.
Adv. Appl. Math., 2024

Galled Tree-Child Networks.
Proceedings of the 35th International Conference on Probabilistic, 2024

Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls.
Proceedings of the 35th International Conference on Probabilistic, 2024

2023
Asymptotic normality for the size of graph tries built from M-ary tree labelings.
Theor. Comput. Sci., August, 2023

Distribution of External Branch Lengths in Yule Histories.
Electron. J. Comb., 2023

2022
Asymptotic enumeration and distributional properties of galled networks.
J. Comb. Theory A, 2022

Bijections for ranked tree-child networks.
Discret. Math., 2022

Counting phylogenetic networks with few reticulation vertices: A second approach.
Discret. Appl. Math., 2022

Enumeration of d-Combining Tree-Child Networks.
Proceedings of the 33rd International Conference on Probabilistic, 2022

2021
Node profiles of symmetric digital search trees: Concentration properties.
Random Struct. Algorithms, 2021

On the asymptotic growth of the number of tree-child networks.
Eur. J. Comb., 2021

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

2019
Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks.
Australas. J Comb., 2019

2018
Refined Asymptotics for the Number of Leaves of Random Point Quadtrees.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Dependence and phase changes in random <i>m</i>-ary search trees.
Random Struct. Algorithms, 2017

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

Dependence between path-length and size in random digital trees.
J. Appl. Probab., 2017

External Profile of Symmetric Digital Search Trees (Extended Abstract).
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
On 2-protected nodes in random digital trees.
Theor. Comput. Sci., 2016

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

2015
The Wiener Index of Random Digital Trees.
SIAM J. Discret. Math., 2015

A note on the quicksort asymptotics.
Random Struct. Algorithms, 2015

2014
An analytic approach to the asymptotic variance of trie statistics and related structures.
Theor. Comput. Sci., 2014

A Binomial Splitting Process in Connection with Corner Parking Problems.
J. Appl. Probab., 2014

A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries.
Electron. J. Comb., 2014

2012
A higher-dimensional Kurzweil theorem for formal Laurent series over finite fields.
Finite Fields Their Appl., 2012

Limit Theorems for Subtree Size Profiles of Increasing Trees.
Comb. Probab. Comput., 2012

2011
The Subtree Size Profile of Plane-oriented Recursive Trees.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010
Asymptotic variance of random symmetric digital search trees.
Discret. Math. Theor. Comput. Sci., 2010

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

2007
Phase changes in random point quadtrees.
ACM Trans. Algorithms, 2007

Invariance principles for Diophantine approximation of formal Laurent series over a finite base field.
Finite Fields Their Appl., 2007

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


  Loading...