Published in: LIPIcs, Volume 302, 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)
Yu-Sheng Chang, Michael Fuchs, and Guan-Ru Yu. Galled Tree-Child Networks. In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 302, pp. 8:1-8:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chang_et_al:LIPIcs.AofA.2024.8, author = {Chang, Yu-Sheng and Fuchs, Michael and Yu, Guan-Ru}, title = {{Galled Tree-Child Networks}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-329-4}, ISSN = {1868-8969}, year = {2024}, volume = {302}, editor = {Mailler, C\'{e}cile and Wild, Sebastian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2024.8}, URN = {urn:nbn:de:0030-drops-204439}, doi = {10.4230/LIPIcs.AofA.2024.8}, annote = {Keywords: Phylogenetic Network, galled Network, tree-child Network, asymptotic Enumeration, Limit Law, Lagrange Inversion} }
Published in: LIPIcs, Volume 302, 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)
Manosij Ghosh Dastidar and Michael Wallner. Asymptotics of Relaxed k-Ary Trees. In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 302, pp. 15:1-15:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ghoshdastidar_et_al:LIPIcs.AofA.2024.15, author = {Ghosh Dastidar, Manosij and Wallner, Michael}, title = {{Asymptotics of Relaxed k-Ary Trees}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-329-4}, ISSN = {1868-8969}, year = {2024}, volume = {302}, editor = {Mailler, C\'{e}cile and Wild, Sebastian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2024.15}, URN = {urn:nbn:de:0030-drops-204506}, doi = {10.4230/LIPIcs.AofA.2024.15}, annote = {Keywords: Asymptotic enumeration, stretched exponential, Airy function, directed acyclic graph, Dyck paths, compacted trees, minimal automata} }
Published in: LIPIcs, Volume 159, 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)
Andrew Elvey Price, Wenjie Fang, and Michael Wallner. Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language. In 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 159, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{elveyprice_et_al:LIPIcs.AofA.2020.11, author = {Elvey Price, Andrew and Fang, Wenjie and Wallner, Michael}, title = {{Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language}}, booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-147-4}, ISSN = {1868-8969}, year = {2020}, volume = {159}, editor = {Drmota, Michael and Heuberger, Clemens}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.11}, URN = {urn:nbn:de:0030-drops-120419}, doi = {10.4230/LIPIcs.AofA.2020.11}, annote = {Keywords: Airy function, asymptotics, directed acyclic graphs, Dyck paths, bijection, stretched exponential, compacted trees, minimal automata, finite languages} }