@Proceedings{ward:LIPIcs.AofA.2022,
title = {{LIPIcs, Volume 225, AofA 2022, Complete Volume}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {1--300},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022},
URN = {urn:nbn:de:0030-drops-160857},
doi = {10.4230/LIPIcs.AofA.2022},
annote = {Keywords: LIPIcs, Volume 225, AofA 2022, Complete Volume}
}
@InProceedings{ward:LIPIcs.AofA.2022.0,
author = {Ward, Mark Daniel},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.0},
URN = {urn:nbn:de:0030-drops-160866},
doi = {10.4230/LIPIcs.AofA.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{akhavi_et_al:LIPIcs.AofA.2022.1,
author = {Akhavi, Ali and Paccaut, Fr\'{e}deric and Vall\'{e}e, Brigitte},
title = {{Building Sources of Zero Entropy: Rescaling and Inserting Delays}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {1:1--1:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.1},
URN = {urn:nbn:de:0030-drops-160879},
doi = {10.4230/LIPIcs.AofA.2022.1},
annote = {Keywords: Information Theory, Probabilistic analysis of sources, Sources with zero-entropy, Analytic combinatorics, Dirichlet generating functions, Transfer operator, Trie structure, Continued fraction expansion, Rice method, Quasi-power Theorem}
}
@InProceedings{bellin:LIPIcs.AofA.2022.2,
author = {Bellin, Etienne},
title = {{On the Independence Number of Random Trees via Tricolourations}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {2:1--2:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.2},
URN = {urn:nbn:de:0030-drops-160886},
doi = {10.4230/LIPIcs.AofA.2022.2},
annote = {Keywords: Independence number, simply generated tree, Galton-Watson tree, tricolouration}
}
@InProceedings{berzunzaojeda_et_al:LIPIcs.AofA.2022.3,
author = {Berzunza Ojeda, Gabriel and Holmgren, Cecilia},
title = {{Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.3},
URN = {urn:nbn:de:0030-drops-160898},
doi = {10.4230/LIPIcs.AofA.2022.3},
annote = {Keywords: Additive coalescent, fragmentation, Galton-Watson trees, spectrally positive stable L\'{e}vy processes, stable L\'{e}vy tree, Prim’s algorithm}
}
@InProceedings{burghart:LIPIcs.AofA.2022.4,
author = {Burghart, Fabian},
title = {{A Modification of the Random Cutting Model}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.4},
URN = {urn:nbn:de:0030-drops-160903},
doi = {10.4230/LIPIcs.AofA.2022.4},
annote = {Keywords: Random cutting model, Random separation of graphs, Percolation}
}
@InProceedings{chang_et_al:LIPIcs.AofA.2022.5,
author = {Chang, Yu-Sheng and Fuchs, Michael and Liu, Hexuan and Wallner, Michael and Yu, Guan-Ru},
title = {{Enumeration of d-Combining Tree-Child Networks}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {5:1--5:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.5},
URN = {urn:nbn:de:0030-drops-160914},
doi = {10.4230/LIPIcs.AofA.2022.5},
annote = {Keywords: Phylogenetic network, tree-child network, d-combining tree-child network, exact enumeration, asymptotic enumeration, reticulation node, limit law, stretched exponential}
}
@InProceedings{chapuy_et_al:LIPIcs.AofA.2022.6,
author = {Chapuy, Guillaume and Louf, Baptiste and Walsh, Harriet},
title = {{Random Partitions Under the Plancherel-Hurwitz Measure, High Genus Hurwitz Numbers and Maps}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {6:1--6:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.6},
URN = {urn:nbn:de:0030-drops-160921},
doi = {10.4230/LIPIcs.AofA.2022.6},
annote = {Keywords: Random partitions, limit shapes, transposition factorisations, map enumeration, Hurwitz numbers, RSK algorithm, giant components}
}
@InProceedings{drmota_et_al:LIPIcs.AofA.2022.7,
author = {Drmota, Michael and Hainzl, Eva-Maria},
title = {{Universal Properties of Catalytic Variable Equations}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.7},
URN = {urn:nbn:de:0030-drops-160930},
doi = {10.4230/LIPIcs.AofA.2022.7},
annote = {Keywords: catalytic equation, singular expansion, univeral asymptotics}
}
@InProceedings{duch_et_al:LIPIcs.AofA.2022.8,
author = {Duch, Amalia and Mart{\'\i}nez, Conrado},
title = {{Partial Match Queries in Quad- K-d Trees}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.8},
URN = {urn:nbn:de:0030-drops-160949},
doi = {10.4230/LIPIcs.AofA.2022.8},
annote = {Keywords: Quadtree, Partial match queries, Associative queries, Multidimensional search, Analysis of algorithms}
}
@InProceedings{gao:LIPIcs.AofA.2022.9,
author = {Gao, Zhicheng},
title = {{Improved Error Bounds for the Number of Irreducible Polynomials and Self-Reciprocal Irreducible Monic Polynomials with Prescribed Coefficients over a Finite Field}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {9:1--9:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.9},
URN = {urn:nbn:de:0030-drops-160958},
doi = {10.4230/LIPIcs.AofA.2022.9},
annote = {Keywords: finite fields, irreducible polynomials, prescribed coefficients, generating functions, Weil bounds, self-reciprocal}
}
@InProceedings{hackl_et_al:LIPIcs.AofA.2022.10,
author = {Hackl, Benjamin and Panholzer, Alois and Wagner, Stephan},
title = {{Uncovering a Random Tree}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.10},
URN = {urn:nbn:de:0030-drops-160962},
doi = {10.4230/LIPIcs.AofA.2022.10},
annote = {Keywords: Labeled tree, uncover process, functional central limit theorem, limiting distribution, phase transition}
}
@InProceedings{jacquet_et_al:LIPIcs.AofA.2022.11,
author = {Jacquet, Philippe and Janson, Svante},
title = {{Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.11},
URN = {urn:nbn:de:0030-drops-160978},
doi = {10.4230/LIPIcs.AofA.2022.11},
annote = {Keywords: Combinatorics, Depth-First Search, Random Digraphs}
}
@InProceedings{lumbroso_et_al:LIPIcs.AofA.2022.12,
author = {Lumbroso, J\'{e}r\'{e}mie and Mart{\'\i}nez, Conrado},
title = {{Affirmative Sampling: Theory and Applications}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.12},
URN = {urn:nbn:de:0030-drops-160987},
doi = {10.4230/LIPIcs.AofA.2022.12},
annote = {Keywords: Data streams, Distinct sampling, Random sampling, Cardinality estimation, Analysis of algorithms}
}
@InProceedings{moreno_et_al:LIPIcs.AofA.2022.13,
author = {Moreno, Bianca Marin and Fricker, Christine and Mohamed, Hanene and Philippe, Amaury and Tr\'{e}panier, Martin},
title = {{Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.13},
URN = {urn:nbn:de:0030-drops-160998},
doi = {10.4230/LIPIcs.AofA.2022.13},
annote = {Keywords: Large scale analysis, mean-field, car-sharing, incentive algorithm, stochastic network, cluster, load balancing, closed Jackson networks, product-form distribution}
}
@InProceedings{neininger_et_al:LIPIcs.AofA.2022.14,
author = {Neininger, Ralph and Straub, Jasmin},
title = {{On the Contraction Method with Reduced Independence Assumptions}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.14},
URN = {urn:nbn:de:0030-drops-161008},
doi = {10.4230/LIPIcs.AofA.2022.14},
annote = {Keywords: Probabilistic Analysis of Algorithms, random Trees, weak Convergence, Probability Metrics, Contraction Method}
}
@InProceedings{nessmann:LIPIcs.AofA.2022.15,
author = {Nessmann, Andreas},
title = {{Polyharmonic Functions in the Quarter Plane}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.15},
URN = {urn:nbn:de:0030-drops-161016},
doi = {10.4230/LIPIcs.AofA.2022.15},
annote = {Keywords: Polyharmonic functions, Functional equations, Lattice paths, Random walks, Brownian motion, Generating functions, Laplace transforms}
}
@InProceedings{olsson_et_al:LIPIcs.AofA.2022.16,
author = {Olsson, Christoffer and Wagner, Stephan},
title = {{Automorphisms of Random Trees}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.16},
URN = {urn:nbn:de:0030-drops-161026},
doi = {10.4230/LIPIcs.AofA.2022.16},
annote = {Keywords: random tree, Galton-Watson tree, P\'{o}lya tree, automorphism group, central limit theorem}
}
@InProceedings{ralaivaosaona:LIPIcs.AofA.2022.17,
author = {Ralaivaosaona, Dimbinaina},
title = {{The Number of Sources and Isolated Vertices in Random Directed Acyclic Graphs}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.17},
URN = {urn:nbn:de:0030-drops-161035},
doi = {10.4230/LIPIcs.AofA.2022.17},
annote = {Keywords: Directed acyclic graph, generating function, central limit theorem}
}
@InProceedings{yin:LIPIcs.AofA.2022.18,
author = {Yin, Mei},
title = {{Parking Functions, Multi-Shuffle, and Asymptotic Phenomena}},
booktitle = {33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022)},
pages = {18:1--18:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-230-3},
ISSN = {1868-8969},
year = {2022},
volume = {225},
editor = {Ward, Mark Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.18},
URN = {urn:nbn:de:0030-drops-161041},
doi = {10.4230/LIPIcs.AofA.2022.18},
annote = {Keywords: Parking function, Multi-shuffle, Asymptotic expansion, Abel’s multinomial theorem}
}
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