<h2>LIPIcs, Volume 159, AofA 2020</h2>
<ul>
<li>
<span class="authors">Michael Drmota and Clemens Heuberger</span>
<span class="title">LIPIcs, Volume 159, AofA 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020">10.4230/LIPIcs.AofA.2020</a>
</li>
<li>
<span class="authors">Michael Drmota and Clemens Heuberger</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.0">10.4230/LIPIcs.AofA.2020.0</a>
</li>
<li>
<span class="authors">Andrei Asinowski and Cyril Banderier</span>
<span class="title">On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.1">10.4230/LIPIcs.AofA.2020.1</a>
</li>
<li>
<span class="authors">Cyril Banderier, Marie-Louise Lackner, and Michael Wallner</span>
<span class="title">Latticepathology and Symmetric Functions (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.2">10.4230/LIPIcs.AofA.2020.2</a>
</li>
<li>
<span class="authors">Frédérique Bassino, Tsinjo Rakotoarimalala, and Andrea Sportiello</span>
<span class="title">The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.3">10.4230/LIPIcs.AofA.2020.3</a>
</li>
<li>
<span class="authors">Valérie Berthé, Eda Cesaratto, Frédéric Paccaut, Pablo Rotondo, Martín D. Safe, and Brigitte Vallée</span>
<span class="title">Two Arithmetical Sources and Their Associated Tries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.4">10.4230/LIPIcs.AofA.2020.4</a>
</li>
<li>
<span class="authors">Gabriel Berzunza, Xing Shi Cai, and Cecilia Holmgren</span>
<span class="title">The k-Cut Model in Conditioned Galton-Watson Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.5">10.4230/LIPIcs.AofA.2020.5</a>
</li>
<li>
<span class="authors">Gabriel Berzunza and Cecilia Holmgren</span>
<span class="title">Largest Clusters for Supercritical Percolation on Split Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.6">10.4230/LIPIcs.AofA.2020.6</a>
</li>
<li>
<span class="authors">Jacopo Borga and Mickaël Maazoun</span>
<span class="title">Scaling and Local Limits of Baxter Permutations Through Coalescent-Walk Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.7">10.4230/LIPIcs.AofA.2020.7</a>
</li>
<li>
<span class="authors">Mireille Bousquet-Mélou and Michael Wallner</span>
<span class="title">More Models of Walks Avoiding a Quadrant</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.8">10.4230/LIPIcs.AofA.2020.8</a>
</li>
<li>
<span class="authors">François Chapon, Éric Fusy, and Kilian Raschel</span>
<span class="title">Polyharmonic Functions And Random Processes in Cones</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.9">10.4230/LIPIcs.AofA.2020.9</a>
</li>
<li>
<span class="authors">Michael Drmota, Marc Noy, and Benedikt Stufler</span>
<span class="title">Cut Vertices in Random Planar Maps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.10">10.4230/LIPIcs.AofA.2020.10</a>
</li>
<li>
<span class="authors">Andrew Elvey Price, Wenjie Fang, and Michael Wallner</span>
<span class="title">Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.11">10.4230/LIPIcs.AofA.2020.11</a>
</li>
<li>
<span class="authors">Ilse Fischer and Matjaž Konvalinka</span>
<span class="title">The First Bijective Proof of the Alternating Sign Matrix Theorem Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.12">10.4230/LIPIcs.AofA.2020.12</a>
</li>
<li>
<span class="authors">Zhicheng Gao and Mihyun Kang</span>
<span class="title">Counting Cubic Maps with Large Genus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.13">10.4230/LIPIcs.AofA.2020.13</a>
</li>
<li>
<span class="authors">Alexander Gnedin and Amirlan Seksenbayev</span>
<span class="title">Diffusion Limits in the Online Subsequence Selection Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.14">10.4230/LIPIcs.AofA.2020.14</a>
</li>
<li>
<span class="authors">Philippe Jacquet and Wojciech Szpankowski</span>
<span class="title">Analysis of Lempel-Ziv'78 for Markov Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.15">10.4230/LIPIcs.AofA.2020.15</a>
</li>
<li>
<span class="authors">Philippe Jacquet, Krzysztof Turowski, and Wojciech Szpankowski</span>
<span class="title">Power-Law Degree Distribution in the Connected Component of a Duplication Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.16">10.4230/LIPIcs.AofA.2020.16</a>
</li>
<li>
<span class="authors">Svante Janson and Wojciech Szpankowski</span>
<span class="title">Hidden Words Statistics for Large Patterns</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.17">10.4230/LIPIcs.AofA.2020.17</a>
</li>
<li>
<span class="authors">Mihyun Kang and Michael Missethan</span>
<span class="title">The Giant Component and 2-Core in Sparse Random Outerplanar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.18">10.4230/LIPIcs.AofA.2020.18</a>
</li>
<li>
<span class="authors">Stefan Klootwijk and Bodo Manthey</span>
<span class="title">Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.19">10.4230/LIPIcs.AofA.2020.19</a>
</li>
<li>
<span class="authors">Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, and Clara Shikhelman</span>
<span class="title">Greedy Maximal Independent Sets via Local Limits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.20">10.4230/LIPIcs.AofA.2020.20</a>
</li>
<li>
<span class="authors">Cécile Mailler, Peter Mörters, and Anna Senkevich</span>
<span class="title">The Disordered Chinese Restaurant and Other Competing Growth Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.21">10.4230/LIPIcs.AofA.2020.21</a>
</li>
<li>
<span class="authors">Ralph Neininger and Jasmin Straub</span>
<span class="title">Convergence Rates in the Probabilistic Analysis of Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.22">10.4230/LIPIcs.AofA.2020.22</a>
</li>
<li>
<span class="authors">Antony Pearson and Manuel E. Lladser</span>
<span class="title">Hidden Independence in Unstructured Probabilistic Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.23">10.4230/LIPIcs.AofA.2020.23</a>
</li>
<li>
<span class="authors">Dimbinaina Ralaivaosaona, Clément Requilé, and Stephan Wagner</span>
<span class="title">Block Statistics in Subcritical Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.24">10.4230/LIPIcs.AofA.2020.24</a>
</li>
<li>
<span class="authors">Dimbinaina Ralaivaosaona, Vonjy Rasendrahasina, and Stephan Wagner</span>
<span class="title">On the Probability That a Random Digraph Is Acyclic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.AofA.2020.25">10.4230/LIPIcs.AofA.2020.25</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