default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Fuchs 0001
Person information
- affiliation: National Chengchi University, Department of Mathematical Sciences, Taiwan
- affiliation (2004 - 2019): National Chiao Tung University, Department of Applied Mathematics, Hsinchu, Taiwan
- affiliation (PhD 2002): Vienna University of Technology, Austria
Other persons with the same name
- Michael Fuchs 0002 — Wilhelm Büchner University of Applied Sciences, Darmstadt, Germany (and 2 more)
- Michael Fuchs 0003 — University of Ulm, Germany
- Michael Fuchs 0004
![[0000-0002-7657-2406]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7657-2406")
— Graz University of Technology, Institute of Electronics, Austria - Michael Fuchs 0005 — University of Neuchatel, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Filippo Disanto, Michael Fuchs, Chun-Yen Huang, Ariel R. Paningbatan, Noah A. Rosenberg:
The distributions under two species-tree models of the total number of ancestral configurations for matching gene trees and species trees. Adv. Appl. Math. 152: 102594 (2024)- [j27]Yu-Sheng Chang, Michael Fuchs, Hexuan Liu, Michael Wallner, Guan-Ru Yu:
Enumerative and distributional results for d-combining tree-child networks. Adv. Appl. Math. 157: 102704 (2024) - [j26]Michael Fuchs, Hexuan Liu, Tsan-Cheng Yu:
Limit theorems for patterns in ranked tree-child networks. Random Struct. Algorithms 64(1): 15-37 (2024) - [c6]Yu-Sheng Chang, Michael Fuchs, Guan-Ru Yu:
Galled Tree-Child Networks. AofA 2024: 8:1-8:13 - [c5]Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger, Noah A. Rosenberg:
Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls. AofA 2024: 27:1-27:14 - 2023
- [j25]Filippo Disanto, Michael Fuchs:
Distribution of External Branch Lengths in Yule Histories. Electron. J. Comb. 30(3) (2023) - [j24]Michael Fuchs, Tsan-Cheng Yu:
Asymptotic normality for the size of graph tries built from M-ary tree labelings. Theor. Comput. Sci. 968: 114011 (2023) - 2022
- [j23]Michael Fuchs, En-Yu Huang, Guan-Ru Yu:
Counting phylogenetic networks with few reticulation vertices: A second approach. Discret. Appl. Math. 320: 140-149 (2022) - [j22]Alessandra Caraceni, Michael Fuchs, Guan-Ru Yu:
Bijections for ranked tree-child networks. Discret. Math. 345(9): 112944 (2022) - [j21]Michael Fuchs, Guan-Ru Yu, Louxin Zhang:
Asymptotic enumeration and distributional properties of galled networks. J. Comb. Theory A 189: 105599 (2022) - [c4]Yu-Sheng Chang, Michael Fuchs, Hexuan Liu, Michael Wallner, Guan-Ru Yu:
Enumeration of d-Combining Tree-Child Networks. AofA 2022: 5:1-5:13 - 2021
- [j20]Michael Fuchs, Cecilia Holmgren, Dieter Mitsche, Ralph Neininger:
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. Discret. Appl. Math. 292: 64-71 (2021) - [j19]Michael Fuchs, Guan-Ru Yu, Louxin Zhang:
On the asymptotic growth of the number of tree-child networks. Eur. J. Comb. 93: 103278 (2021) - [j18]Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Node profiles of symmetric digital search trees: Concentration properties. Random Struct. Algorithms 58(3): 430-467 (2021)
2010 – 2019
- 2019
- [j17]Michael Fuchs, Bernhard Gittenberger, Marefatollah Mansouri:
Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks. Australas. J Comb. 73: 385-423 (2019) - 2018
- [c3]Michael Fuchs, Noela S. Müller, Henning Sulzbach:
Refined Asymptotics for the Number of Leaves of Random Point Quadtrees. AofA 2018: 23:1-23:16 - 2017
- [j16]Michael Fuchs, Hsien-Kuei Hwang, Yoshiaki Itoh:
From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader. J. Appl. Probab. 54(1): 213-235 (2017) - [j15]Michael Fuchs, Hsien-Kuei Hwang:
Dependence between path-length and size in random digital trees. J. Appl. Probab. 54(4): 1125-1143 (2017) - [j14]Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Dependence and phase changes in random m-ary search trees. Random Struct. Algorithms 50(3): 353-379 (2017) - [c2]Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
External Profile of Symmetric Digital Search Trees (Extended Abstract). ANALCO 2017: 124-130 - 2016
- [j13]Michael Fuchs, C.-K. Lee, G.-R. Yu:
On 2-protected nodes in random digital trees. Theor. Comput. Sci. 622: 111-122 (2016) - [i2]Michael Fuchs, Hsien-Kuei Hwang:
Dependence between External Path-Length and Size in Random Tries. CoRR abs/1604.08658 (2016) - 2015
- [j12]Michael Fuchs:
A note on the quicksort asymptotics. Random Struct. Algorithms 46(4): 677-687 (2015) - [j11]Michael Fuchs, Chung-Kuei Lee:
The Wiener Index of Random Digital Trees. SIAM J. Discret. Math. 29(1): 586-614 (2015) - 2014
- [j10]Michael Fuchs, Chung-Kuei Lee:
A General Central Limit Theorem for Shape Parameters of $m$-ary Tries and PATRICIA Tries. Electron. J. Comb. 21(1): 1 (2014) - [j9]Michael Fuchs, Hsien-Kuei Hwang, Yoshiaki Itoh, Hosam M. Mahmoud:
A Binomial Splitting Process in Connection with Corner Parking Problems. J. Appl. Probab. 51(4): 971-989 (2014) - [j8]Michael Fuchs, Hsien-Kuei Hwang, Vytas Zacharovas:
An analytic approach to the asymptotic variance of trie statistics and related structures. Theor. Comput. Sci. 527: 1-36 (2014) - 2013
- [i1]Michael Fuchs, Hsien-Kuei Hwang, Vytas Zacharovas:
An analytic approach to the asymptotic variance of trie statistics and related structures. CoRR abs/1303.4244 (2013) - 2012
- [j7]Michael Fuchs:
Limit Theorems for Subtree Size Profiles of Increasing Trees. Comb. Probab. Comput. 21(3): 412-441 (2012) - [j6]Shu-Yi Chen, Michael Fuchs:
A higher-dimensional Kurzweil theorem for formal Laurent series over finite fields. Finite Fields Their Appl. 18(6): 1195-1206 (2012) - 2011
- [c1]Michael Fuchs:
The Subtree Size Profile of Plane-oriented Recursive Trees. ANALCO 2011: 85-92 - 2010
- [j5]Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas:
Asymptotic variance of random symmetric digital search trees. Discret. Math. Theor. Comput. Sci. 12(2): 103-166 (2010)
2000 – 2009
- 2008
- [j4]Michael Fuchs:
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations. Comb. Probab. Comput. 17(5): 661-680 (2008) - 2007
- [j3]Eveyth Deligero, Michael Fuchs, Hitoshi Nakada:
Invariance principles for Diophantine approximation of formal Laurent series over a finite base field. Finite Fields Their Appl. 13(3): 535-545 (2007) - [j2]Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang:
Phase changes in random point quadtrees. ACM Trans. Algorithms 3(2): 12 (2007) - 2006
- [j1]Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. Algorithmica 46(3-4): 367-407 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
