<h2>LIPIcs, Volume 302, AofA 2024</h2>
<ul>
<li>
<span class="authors">Cécile Mailler and Sebastian Wild</span>
<span class="title">LIPIcs, Volume 302, AofA 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024">10.4230/LIPIcs.AofA.2024</a>
</li>
<li>
<span class="authors">Cécile Mailler and Sebastian Wild</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.0">10.4230/LIPIcs.AofA.2024.0</a>
</li>
<li>
<span class="authors">Gabriel Berzunza Ojeda, Cecilia Holmgren, and Svante Janson</span>
<span class="title">Fringe Trees for Random Trees with Given Vertex Degrees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.1">10.4230/LIPIcs.AofA.2024.1</a>
</li>
<li>
<span class="authors">Jeremy Chizewer, Stephen Melczer, J. Ian Munro, and Ava Pun</span>
<span class="title">Enumeration and Succinct Encoding of AVL Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.2">10.4230/LIPIcs.AofA.2024.2</a>
</li>
<li>
<span class="authors">Wenjie Fang</span>
<span class="title">Maximal Number of Subword Occurrences in a Word</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.3">10.4230/LIPIcs.AofA.2024.3</a>
</li>
<li>
<span class="authors">Sean Svihla and Manuel E. Lladser</span>
<span class="title">Sparsification of Phylogenetic Covariance Matrices of k-Regular Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.4">10.4230/LIPIcs.AofA.2024.4</a>
</li>
<li>
<span class="authors">Svante Janson, Jérémie Lumbroso, and Robert Sedgewick</span>
<span class="title">Bit-Array-Based Alternatives to HyperLogLog</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.5">10.4230/LIPIcs.AofA.2024.5</a>
</li>
<li>
<span class="authors">Marie Albenque, Éric Fusy, and Zéphyr Salvy</span>
<span class="title">Phase Transition for Tree-Rooted Maps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.6">10.4230/LIPIcs.AofA.2024.6</a>
</li>
<li>
<span class="authors">Cyril Banderier, Markus Kuba, Stephan Wagner, and Michael Wallner</span>
<span class="title">Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.7">10.4230/LIPIcs.AofA.2024.7</a>
</li>
<li>
<span class="authors">Yu-Sheng Chang, Michael Fuchs, and Guan-Ru Yu</span>
<span class="title">Galled Tree-Child Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.8">10.4230/LIPIcs.AofA.2024.8</a>
</li>
<li>
<span class="authors">Jasper Ischebeck and Ralph Neininger</span>
<span class="title">On Fluctuations of Complexity Measures for the FIND Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.9">10.4230/LIPIcs.AofA.2024.9</a>
</li>
<li>
<span class="authors">Fabian Burghart and Stephan Wagner</span>
<span class="title">A Bijection for the Evolution of B-Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.10">10.4230/LIPIcs.AofA.2024.10</a>
</li>
<li>
<span class="authors">Eva-Maria Hainzl and Élie de Panafieu</span>
<span class="title">Tree Walks and the Spectrum of Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.11">10.4230/LIPIcs.AofA.2024.11</a>
</li>
<li>
<span class="authors">Torin Greenwood and Samuel Simon</span>
<span class="title">Asymptotics of Weighted Reflectable Walks in A₂</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.12">10.4230/LIPIcs.AofA.2024.12</a>
</li>
<li>
<span class="authors">Stephan Wagner</span>
<span class="title">On the Number of Distinct Fringe Subtrees in Binary Search Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.13">10.4230/LIPIcs.AofA.2024.13</a>
</li>
<li>
<span class="authors">Peter Mörters and Nick Schleicher</span>
<span class="title">Early Typical Vertices in Subcritical Random Graphs of Preferential Attachment Type</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.14">10.4230/LIPIcs.AofA.2024.14</a>
</li>
<li>
<span class="authors">Manosij Ghosh Dastidar and Michael Wallner</span>
<span class="title">Asymptotics of Relaxed k-Ary Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.15">10.4230/LIPIcs.AofA.2024.15</a>
</li>
<li>
<span class="authors">Anna Brandenberger, Byron Chin, Nathan S. Sheffield, and Divya Shyamal</span>
<span class="title">Matching Algorithms in the Sparse Stochastic Block Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.16">10.4230/LIPIcs.AofA.2024.16</a>
</li>
<li>
<span class="authors">Amaury Curiel and Antoine Genitrini</span>
<span class="title">Lexicographic Unranking Algorithms for the Twelvefold Way</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.17">10.4230/LIPIcs.AofA.2024.17</a>
</li>
<li>
<span class="authors">Michael R. Doboli, Hsien-Kuei Hwang, and Noah A. Rosenberg</span>
<span class="title">Periodic Behavior of the Minimal Colijn-Plazzotta Rank for Trees with a Fixed Number of Leaves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.18">10.4230/LIPIcs.AofA.2024.18</a>
</li>
<li>
<span class="authors">Benjamin Hackl and Stephan Wagner</span>
<span class="title">Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.19">10.4230/LIPIcs.AofA.2024.19</a>
</li>
<li>
<span class="authors">Sam Olesker-Taylor</span>
<span class="title">Multicoloured Hardcore Model: Fast Mixing and Its Applications as a Scheduling Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.20">10.4230/LIPIcs.AofA.2024.20</a>
</li>
<li>
<span class="authors">Benoît Corsini, Victor Dubach, and Valentin Féray</span>
<span class="title">Binary Search Trees of Permuton Samples</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.21">10.4230/LIPIcs.AofA.2024.21</a>
</li>
<li>
<span class="authors">Shuma Kumamoto, Shuji Kijima, and Tomoyuki Shirai</span>
<span class="title">The Recurrence/Transience of Random Walks on a Bounded Grid in an Increasing Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.22">10.4230/LIPIcs.AofA.2024.22</a>
</li>
<li>
<span class="authors">Vincent Jugé and June Roupin</span>
<span class="title">The Alternating Normal Form of Braids and Its Minimal Automaton</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.23">10.4230/LIPIcs.AofA.2024.23</a>
</li>
<li>
<span class="authors">Clemens Heuberger, Daniel Krenn, and Tobias Lechner</span>
<span class="title">Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.24">10.4230/LIPIcs.AofA.2024.24</a>
</li>
<li>
<span class="authors">Louigi Addario-Berry, Pat Morin, and Ralph Neininger</span>
<span class="title">Patricia’s Bad Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.25">10.4230/LIPIcs.AofA.2024.25</a>
</li>
<li>
<span class="authors">Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou, and Annika Steibel</span>
<span class="title">Limit Laws for Critical Dispersion on Complete Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.26">10.4230/LIPIcs.AofA.2024.26</a>
</li>
<li>
<span class="authors">Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger, and Noah A. Rosenberg</span>
<span class="title">Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.27">10.4230/LIPIcs.AofA.2024.27</a>
</li>
<li>
<span class="authors">James Allen Fill, Daniel Q. Naiman, and Ao Sun</span>
<span class="title">Sharpened Localization of the Trailing Point of the Pareto Record Frontier</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.28">10.4230/LIPIcs.AofA.2024.28</a>
</li>
<li>
<span class="authors">Stephan Wagner and Mei Yin</span>
<span class="title">Statistics of Parking Functions and Labeled Forests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.29">10.4230/LIPIcs.AofA.2024.29</a>
</li>
<li>
<span class="authors">Philippe Jacquet and Svante Janson</span>
<span class="title">Depth-First Search Performance in Random Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2024.30">10.4230/LIPIcs.AofA.2024.30</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode