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. 1-458, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Proceedings{mailler_et_al:LIPIcs.AofA.2024, title = {{LIPIcs, Volume 302, AofA 2024, Complete Volume}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {1--458}, 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}, URN = {urn:nbn:de:0030-drops-204341}, doi = {10.4230/LIPIcs.AofA.2024}, annote = {Keywords: LIPIcs, Volume 302, AofA 2024, Complete Volume} }
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. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{mailler_et_al:LIPIcs.AofA.2024.0, author = {Mailler, C\'{e}cile and Wild, Sebastian}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {0:i--0:xii}, 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.0}, URN = {urn:nbn:de:0030-drops-204353}, doi = {10.4230/LIPIcs.AofA.2024.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Gabriel Berzunza Ojeda, Cecilia Holmgren, and Svante Janson. Fringe Trees for Random Trees with Given Vertex Degrees. 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. 1:1-1:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{berzunzaojeda_et_al:LIPIcs.AofA.2024.1, author = {Berzunza Ojeda, Gabriel and Holmgren, Cecilia and Janson, Svante}, title = {{Fringe Trees for Random Trees with Given Vertex Degrees}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {1:1--1: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.1}, URN = {urn:nbn:de:0030-drops-204369}, doi = {10.4230/LIPIcs.AofA.2024.1}, annote = {Keywords: Conditioned Galton-Watson trees, fringe trees, simply generated trees, uniformly random trees with given vertex degrees} }
Jeremy Chizewer, Stephen Melczer, J. Ian Munro, and Ava Pun. Enumeration and Succinct Encoding of AVL 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. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chizewer_et_al:LIPIcs.AofA.2024.2, author = {Chizewer, Jeremy and Melczer, Stephen and Munro, J. Ian and Pun, Ava}, title = {{Enumeration and Succinct Encoding of AVL Trees}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {2:1--2:12}, 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.2}, URN = {urn:nbn:de:0030-drops-204376}, doi = {10.4230/LIPIcs.AofA.2024.2}, annote = {Keywords: AVL trees, analytic combinatorics, succinct data structures, enumeration} }
Wenjie Fang. Maximal Number of Subword Occurrences in a Word. 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. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fang:LIPIcs.AofA.2024.3, author = {Fang, Wenjie}, title = {{Maximal Number of Subword Occurrences in a Word}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {3:1--3:12}, 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.3}, URN = {urn:nbn:de:0030-drops-204387}, doi = {10.4230/LIPIcs.AofA.2024.3}, annote = {Keywords: Subword occurrence, subword entropy, enumeration, periodic words} }
Sean Svihla and Manuel E. Lladser. Sparsification of Phylogenetic Covariance Matrices of k-Regular 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. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{svihla_et_al:LIPIcs.AofA.2024.4, author = {Svihla, Sean and Lladser, Manuel E.}, title = {{Sparsification of Phylogenetic Covariance Matrices of k-Regular Trees}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {4:1--4:17}, 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.4}, URN = {urn:nbn:de:0030-drops-204399}, doi = {10.4230/LIPIcs.AofA.2024.4}, annote = {Keywords: cophenetic matrix, Haar-like wavelets, hierarchical data, hypergeometric functions, metagenomics, phylogenetic covariance matrix, sparsification, ultrametric matrix} }
Svante Janson, Jérémie Lumbroso, and Robert Sedgewick. Bit-Array-Based Alternatives to HyperLogLog. 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. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{janson_et_al:LIPIcs.AofA.2024.5, author = {Janson, Svante and Lumbroso, J\'{e}r\'{e}mie and Sedgewick, Robert}, title = {{Bit-Array-Based Alternatives to HyperLogLog}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {5:1--5:19}, 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.5}, URN = {urn:nbn:de:0030-drops-204402}, doi = {10.4230/LIPIcs.AofA.2024.5}, annote = {Keywords: Cardinality estimation, sketching, Hyperloglog} }
Marie Albenque, Éric Fusy, and Zéphyr Salvy. Phase Transition for Tree-Rooted Maps. 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. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{albenque_et_al:LIPIcs.AofA.2024.6, author = {Albenque, Marie and Fusy, \'{E}ric and Salvy, Z\'{e}phyr}, title = {{Phase Transition for Tree-Rooted Maps}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {6:1--6:14}, 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.6}, URN = {urn:nbn:de:0030-drops-204413}, doi = {10.4230/LIPIcs.AofA.2024.6}, annote = {Keywords: Asymptotic Enumeration, Planar maps, Random trees, Phase transition} }
Cyril Banderier, Markus Kuba, Stephan Wagner, and Michael Wallner. Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models. 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. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{banderier_et_al:LIPIcs.AofA.2024.7, author = {Banderier, Cyril and Kuba, Markus and Wagner, Stephan and Wallner, Michael}, title = {{Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {7:1--7:18}, 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.7}, URN = {urn:nbn:de:0030-drops-204427}, doi = {10.4230/LIPIcs.AofA.2024.7}, annote = {Keywords: Composition schemes, q-enumeration, generating functions, Gibbs distribution, phase transitions, limit laws, Mittag-Leffler distribution, chi distribution, Boltzmann distribution} }
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} }
Jasper Ischebeck and Ralph Neininger. On Fluctuations of Complexity Measures for the FIND Algorithm. 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. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ischebeck_et_al:LIPIcs.AofA.2024.9, author = {Ischebeck, Jasper and Neininger, Ralph}, title = {{On Fluctuations of Complexity Measures for the FIND Algorithm}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {9:1--9:15}, 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.9}, URN = {urn:nbn:de:0030-drops-204440}, doi = {10.4230/LIPIcs.AofA.2024.9}, annote = {Keywords: FIND, Quickselect, rank selection, probabilistic analysis of algorithms, weak convergence, functional limit theorem} }
Fabian Burghart and Stephan Wagner. A Bijection for the Evolution of B-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. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{burghart_et_al:LIPIcs.AofA.2024.10, author = {Burghart, Fabian and Wagner, Stephan}, title = {{A Bijection for the Evolution of B-Trees}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {10:1--10:15}, 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.10}, URN = {urn:nbn:de:0030-drops-204451}, doi = {10.4230/LIPIcs.AofA.2024.10}, annote = {Keywords: B-trees, histories, increasing trees, bijection, asymptotic enumeration, tree statistics} }
Eva-Maria Hainzl and Élie de Panafieu. Tree Walks and the Spectrum of Random Graphs. 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. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hainzl_et_al:LIPIcs.AofA.2024.11, author = {Hainzl, Eva-Maria and de Panafieu, \'{E}lie}, title = {{Tree Walks and the Spectrum of Random Graphs}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {11:1--11:15}, 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.11}, URN = {urn:nbn:de:0030-drops-204466}, doi = {10.4230/LIPIcs.AofA.2024.11}, annote = {Keywords: Spectrum of random matrices, generating functions} }
Torin Greenwood and Samuel Simon. Asymptotics of Weighted Reflectable Walks in A₂. 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. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{greenwood_et_al:LIPIcs.AofA.2024.12, author = {Greenwood, Torin and Simon, Samuel}, title = {{Asymptotics of Weighted Reflectable Walks in A₂}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {12:1--12:14}, 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.12}, URN = {urn:nbn:de:0030-drops-204472}, doi = {10.4230/LIPIcs.AofA.2024.12}, annote = {Keywords: Lattice walks, Weyl chambers, asymptotics weights, analytic combinatorics in several variables} }
Stephan Wagner. On the Number of Distinct Fringe Subtrees in Binary Search 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. 13:1-13:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{wagner:LIPIcs.AofA.2024.13, author = {Wagner, Stephan}, title = {{On the Number of Distinct Fringe Subtrees in Binary Search Trees}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {13:1--13:11}, 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.13}, URN = {urn:nbn:de:0030-drops-204482}, doi = {10.4230/LIPIcs.AofA.2024.13}, annote = {Keywords: Fringe subtrees, binary search trees, tree compression, minimal DAG, asymptotics} }
Peter Mörters and Nick Schleicher. Early Typical Vertices in Subcritical Random Graphs of Preferential Attachment Type. 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. 14:1-14:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{morters_et_al:LIPIcs.AofA.2024.14, author = {M\"{o}rters, Peter and Schleicher, Nick}, title = {{Early Typical Vertices in Subcritical Random Graphs of Preferential Attachment Type}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {14:1--14:10}, 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.14}, URN = {urn:nbn:de:0030-drops-204493}, doi = {10.4230/LIPIcs.AofA.2024.14}, annote = {Keywords: Inhomogeneous random graphs, preferential attachment, networks, subcritical behaviour, size of components, connectivity, coupling, branching random walk, random tree} }
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} }
Anna Brandenberger, Byron Chin, Nathan S. Sheffield, and Divya Shyamal. Matching Algorithms in the Sparse Stochastic Block Model. 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. 16:1-16:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{brandenberger_et_al:LIPIcs.AofA.2024.16, author = {Brandenberger, Anna and Chin, Byron and Sheffield, Nathan S. and Shyamal, Divya}, title = {{Matching Algorithms in the Sparse Stochastic Block Model}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {16:1--16:21}, 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.16}, URN = {urn:nbn:de:0030-drops-204515}, doi = {10.4230/LIPIcs.AofA.2024.16}, annote = {Keywords: Matching Algorithms, Online Matching, Stochastic Block Model} }
Amaury Curiel and Antoine Genitrini. Lexicographic Unranking Algorithms for the Twelvefold Way. 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. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{curiel_et_al:LIPIcs.AofA.2024.17, author = {Curiel, Amaury and Genitrini, Antoine}, title = {{Lexicographic Unranking Algorithms for the Twelvefold Way}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {17:1--17:14}, 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.17}, URN = {urn:nbn:de:0030-drops-204522}, doi = {10.4230/LIPIcs.AofA.2024.17}, annote = {Keywords: Twelvefold Way, Set partitions, Unranking, Lexicographic order} }
Michael R. Doboli, Hsien-Kuei Hwang, and Noah A. Rosenberg. Periodic Behavior of the Minimal Colijn-Plazzotta Rank for Trees with a Fixed Number of Leaves. 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. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{doboli_et_al:LIPIcs.AofA.2024.18, author = {Doboli, Michael R. and Hwang, Hsien-Kuei and Rosenberg, Noah A.}, title = {{Periodic Behavior of the Minimal Colijn-Plazzotta Rank for Trees with a Fixed Number of Leaves}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {18:1--18:14}, 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.18}, URN = {urn:nbn:de:0030-drops-204530}, doi = {10.4230/LIPIcs.AofA.2024.18}, annote = {Keywords: Colijn-Plazzotta ranking, recurrences, unlabeled trees} }
Benjamin Hackl and Stephan Wagner. Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study. 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. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hackl_et_al:LIPIcs.AofA.2024.19, author = {Hackl, Benjamin and Wagner, Stephan}, title = {{Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {19:1--19:15}, 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.19}, URN = {urn:nbn:de:0030-drops-204549}, doi = {10.4230/LIPIcs.AofA.2024.19}, annote = {Keywords: binomial sum, Mellin transform, asymptotics, explicit error bounds, B-terms} }
Sam Olesker-Taylor. Multicoloured Hardcore Model: Fast Mixing and Its Applications as a Scheduling Algorithm. 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. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{oleskertaylor:LIPIcs.AofA.2024.20, author = {Olesker-Taylor, Sam}, title = {{Multicoloured Hardcore Model: Fast Mixing and Its Applications as a Scheduling Algorithm}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {20:1--20:14}, 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.20}, URN = {urn:nbn:de:0030-drops-204558}, doi = {10.4230/LIPIcs.AofA.2024.20}, annote = {Keywords: mixing time, queueing theory, hardcore model, proper colourings, independent set, data transmission, randomised algorithms, routing, scheduling, multihop wireless networks} }
Benoît Corsini, Victor Dubach, and Valentin Féray. Binary Search Trees of Permuton Samples. 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. 21:1-21:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{corsini_et_al:LIPIcs.AofA.2024.21, author = {Corsini, Beno\^{i}t and Dubach, Victor and F\'{e}ray, Valentin}, title = {{Binary Search Trees of Permuton Samples}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {21:1--21: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.21}, URN = {urn:nbn:de:0030-drops-204562}, doi = {10.4230/LIPIcs.AofA.2024.21}, annote = {Keywords: Binary search trees, random permutations, permutons} }
Shuma Kumamoto, Shuji Kijima, and Tomoyuki Shirai. The Recurrence/Transience of Random Walks on a Bounded Grid in an Increasing Dimension. 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. 22:1-22:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kumamoto_et_al:LIPIcs.AofA.2024.22, author = {Kumamoto, Shuma and Kijima, Shuji and Shirai, Tomoyuki}, title = {{The Recurrence/Transience of Random Walks on a Bounded Grid in an Increasing Dimension}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {22:1--22:15}, 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.22}, URN = {urn:nbn:de:0030-drops-204577}, doi = {10.4230/LIPIcs.AofA.2024.22}, annote = {Keywords: Random walk, dynamic graph, recurrence, transience, coupling} }
Vincent Jugé and June Roupin. The Alternating Normal Form of Braids and Its Minimal Automaton. 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. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{juge_et_al:LIPIcs.AofA.2024.23, author = {Jug\'{e}, Vincent and Roupin, June}, title = {{The Alternating Normal Form of Braids and Its Minimal Automaton}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {23:1--23:15}, 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.23}, URN = {urn:nbn:de:0030-drops-204587}, doi = {10.4230/LIPIcs.AofA.2024.23}, annote = {Keywords: Automata, braids, enumeration, normal forms} }
Clemens Heuberger, Daniel Krenn, and Tobias Lechner. Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences. 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. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{heuberger_et_al:LIPIcs.AofA.2024.24, author = {Heuberger, Clemens and Krenn, Daniel and Lechner, Tobias}, title = {{Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {24:1--24:14}, 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.24}, URN = {urn:nbn:de:0030-drops-204597}, doi = {10.4230/LIPIcs.AofA.2024.24}, annote = {Keywords: Regular sequence, Divide-and-Conquer Recurrence, Summatory Function, Asymptotic Analysis} }
Louigi Addario-Berry, Pat Morin, and Ralph Neininger. Patricia’s Bad Distributions. 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. 25:1-25:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{addarioberry_et_al:LIPIcs.AofA.2024.25, author = {Addario-Berry, Louigi and Morin, Pat and Neininger, Ralph}, title = {{Patricia’s Bad Distributions}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {25:1--25:8}, 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.25}, URN = {urn:nbn:de:0030-drops-204600}, doi = {10.4230/LIPIcs.AofA.2024.25}, annote = {Keywords: PATRICIA tree, random tree, height of tree, analysis of algorithms} }
Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou, and Annika Steibel. Limit Laws for Critical Dispersion on Complete Graphs. 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. 26:1-26:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{deambroggio_et_al:LIPIcs.AofA.2024.26, author = {De Ambroggio, Umberto and Makai, Tam\'{a}s and Panagiotou, Konstantinos and Steibel, Annika}, title = {{Limit Laws for Critical Dispersion on Complete Graphs}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {26:1--26:12}, 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.26}, URN = {urn:nbn:de:0030-drops-204617}, doi = {10.4230/LIPIcs.AofA.2024.26}, annote = {Keywords: Random processes on graphs, diffusion processes, stochastic differential equations, martingale inequalities} }
Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger, and Noah A. Rosenberg. Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls. 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. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{agranattamir_et_al:LIPIcs.AofA.2024.27, author = {Agranat-Tamir, Lily and Fuchs, Michael and Gittenberger, Bernhard and Rosenberg, Noah A.}, title = {{Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {27:1--27:14}, 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.27}, URN = {urn:nbn:de:0030-drops-204626}, doi = {10.4230/LIPIcs.AofA.2024.27}, annote = {Keywords: galled trees, generating functions, phylogenetics, unlabeled trees} }
James Allen Fill, Daniel Q. Naiman, and Ao Sun. Sharpened Localization of the Trailing Point of the Pareto Record Frontier. 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. 28:1-28:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fill_et_al:LIPIcs.AofA.2024.28, author = {Fill, James Allen and Naiman, Daniel Q. and Sun, Ao}, title = {{Sharpened Localization of the Trailing Point of the Pareto Record Frontier}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {28:1--28:21}, 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.28}, URN = {urn:nbn:de:0030-drops-204631}, doi = {10.4230/LIPIcs.AofA.2024.28}, annote = {Keywords: Multivariate records, Pareto records, generators, interior generators, minima, maxima, record-setting region, frontier, current records, boundary-crossing probabilities, first moment method, second moment method, orthants} }
Stephan Wagner and Mei Yin. Statistics of Parking Functions and Labeled Forests. 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. 29:1-29:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{wagner_et_al:LIPIcs.AofA.2024.29, author = {Wagner, Stephan and Yin, Mei}, title = {{Statistics of Parking Functions and Labeled Forests}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {29:1--29:14}, 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.29}, URN = {urn:nbn:de:0030-drops-204648}, doi = {10.4230/LIPIcs.AofA.2024.29}, annote = {Keywords: parking function, labeled forest, generating function, Pollak’s circle argument, bijection} }
Philippe Jacquet and Svante Janson. Depth-First Search Performance in Random Digraphs. 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. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{jacquet_et_al:LIPIcs.AofA.2024.30, author = {Jacquet, Philippe and Janson, Svante}, title = {{Depth-First Search Performance in Random Digraphs}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {30:1--30:15}, 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.30}, URN = {urn:nbn:de:0030-drops-204655}, doi = {10.4230/LIPIcs.AofA.2024.30}, annote = {Keywords: Depth First Search, random digraph, Analysis of Algorithms} }