<h2>LIPIcs, Volume 225, AofA 2022</h2>
<ul>
<li>
<span class="authors">Mark Daniel Ward</span>
<span class="title">LIPIcs, Volume 225, AofA 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022">10.4230/LIPIcs.AofA.2022</a>
</li>
<li>
<span class="authors">Mark Daniel Ward</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.0">10.4230/LIPIcs.AofA.2022.0</a>
</li>
<li>
<span class="authors">Ali Akhavi, Fréderic Paccaut, and Brigitte Vallée</span>
<span class="title">Building Sources of Zero Entropy: Rescaling and Inserting Delays (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.1">10.4230/LIPIcs.AofA.2022.1</a>
</li>
<li>
<span class="authors">Etienne Bellin</span>
<span class="title">On the Independence Number of Random Trees via Tricolourations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.2">10.4230/LIPIcs.AofA.2022.2</a>
</li>
<li>
<span class="authors">Gabriel Berzunza Ojeda and Cecilia Holmgren</span>
<span class="title">Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.3">10.4230/LIPIcs.AofA.2022.3</a>
</li>
<li>
<span class="authors">Fabian Burghart</span>
<span class="title">A Modification of the Random Cutting Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.4">10.4230/LIPIcs.AofA.2022.4</a>
</li>
<li>
<span class="authors">Yu-Sheng Chang, Michael Fuchs, Hexuan Liu, Michael Wallner, and Guan-Ru Yu</span>
<span class="title">Enumeration of d-Combining Tree-Child Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.5">10.4230/LIPIcs.AofA.2022.5</a>
</li>
<li>
<span class="authors">Guillaume Chapuy, Baptiste Louf, and Harriet Walsh</span>
<span class="title">Random Partitions Under the Plancherel-Hurwitz Measure, High Genus Hurwitz Numbers and Maps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.6">10.4230/LIPIcs.AofA.2022.6</a>
</li>
<li>
<span class="authors">Michael Drmota and Eva-Maria Hainzl</span>
<span class="title">Universal Properties of Catalytic Variable Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.7">10.4230/LIPIcs.AofA.2022.7</a>
</li>
<li>
<span class="authors">Amalia Duch and Conrado Martínez</span>
<span class="title">Partial Match Queries in Quad- K-d Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.8">10.4230/LIPIcs.AofA.2022.8</a>
</li>
<li>
<span class="authors">Zhicheng Gao</span>
<span class="title">Improved Error Bounds for the Number of Irreducible Polynomials and Self-Reciprocal Irreducible Monic Polynomials with Prescribed Coefficients over a Finite Field</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.9">10.4230/LIPIcs.AofA.2022.9</a>
</li>
<li>
<span class="authors">Benjamin Hackl, Alois Panholzer, and Stephan Wagner</span>
<span class="title">Uncovering a Random Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.10">10.4230/LIPIcs.AofA.2022.10</a>
</li>
<li>
<span class="authors">Philippe Jacquet and Svante Janson</span>
<span class="title">Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.11">10.4230/LIPIcs.AofA.2022.11</a>
</li>
<li>
<span class="authors">Jérémie Lumbroso and Conrado Martínez</span>
<span class="title">Affirmative Sampling: Theory and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.12">10.4230/LIPIcs.AofA.2022.12</a>
</li>
<li>
<span class="authors">Bianca Marin Moreno, Christine Fricker, Hanene Mohamed, Amaury Philippe, and Martin Trépanier</span>
<span class="title">Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.13">10.4230/LIPIcs.AofA.2022.13</a>
</li>
<li>
<span class="authors">Ralph Neininger and Jasmin Straub</span>
<span class="title">On the Contraction Method with Reduced Independence Assumptions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.14">10.4230/LIPIcs.AofA.2022.14</a>
</li>
<li>
<span class="authors">Andreas Nessmann</span>
<span class="title">Polyharmonic Functions in the Quarter Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.15">10.4230/LIPIcs.AofA.2022.15</a>
</li>
<li>
<span class="authors">Christoffer Olsson and Stephan Wagner</span>
<span class="title">Automorphisms of Random Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.16">10.4230/LIPIcs.AofA.2022.16</a>
</li>
<li>
<span class="authors">Dimbinaina Ralaivaosaona</span>
<span class="title">The Number of Sources and Isolated Vertices in Random Directed Acyclic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.17">10.4230/LIPIcs.AofA.2022.17</a>
</li>
<li>
<span class="authors">Mei Yin</span>
<span class="title">Parking Functions, Multi-Shuffle, and Asymptotic Phenomena</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2022.18">10.4230/LIPIcs.AofA.2022.18</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
Feedback for Dagstuhl Publishing