@Proceedings{drmota_et_al:LIPIcs.AofA.2020,
title = {{LIPIcs, Volume 159, AofA 2020, Complete Volume}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {1--402},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020},
URN = {urn:nbn:de:0030-drops-120296},
doi = {10.4230/LIPIcs.AofA.2020},
annote = {Keywords: LIPIcs, Volume 159, AofA 2020, Complete Volume}
}
@InProceedings{drmota_et_al:LIPIcs.AofA.2020.0,
author = {Drmota, Michael and Heuberger, Clemens},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.0},
URN = {urn:nbn:de:0030-drops-120309},
doi = {10.4230/LIPIcs.AofA.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{asinowski_et_al:LIPIcs.AofA.2020.1,
author = {Asinowski, Andrei and Banderier, Cyril},
title = {{On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {1:1--1:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.1},
URN = {urn:nbn:de:0030-drops-120317},
doi = {10.4230/LIPIcs.AofA.2020.1},
annote = {Keywords: Lattice path, Dyck path, Motzkin path, generating function, algebraic function, kernel method, context-free grammar, multivariate Gaussian distribution}
}
@InProceedings{banderier_et_al:LIPIcs.AofA.2020.2,
author = {Banderier, Cyril and Lackner, Marie-Louise and Wallner, Michael},
title = {{Latticepathology and Symmetric Functions (Extended Abstract)}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {2:1--2:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.2},
URN = {urn:nbn:de:0030-drops-120329},
doi = {10.4230/LIPIcs.AofA.2020.2},
annote = {Keywords: Lattice path, generating function, symmetric function, algebraic function, kernel method, context-free grammar, Sparre Andersen formula, Spitzer’s identity, Wiener - Hopf factorization}
}
@InProceedings{bassino_et_al:LIPIcs.AofA.2020.3,
author = {Bassino, Fr\'{e}d\'{e}rique and Rakotoarimalala, Tsinjo and Sportiello, Andrea},
title = {{The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.3},
URN = {urn:nbn:de:0030-drops-120336},
doi = {10.4230/LIPIcs.AofA.2020.3},
annote = {Keywords: Average-case analysis of algorithms, String Pattern Matching, Computational Complexity bounds}
}
@InProceedings{berthe_et_al:LIPIcs.AofA.2020.4,
author = {Berth\'{e}, Val\'{e}rie and Cesaratto, Eda and Paccaut, Fr\'{e}d\'{e}ric and Rotondo, Pablo and Safe, Mart{\'\i}n D. and Vall\'{e}e, Brigitte},
title = {{Two Arithmetical Sources and Their Associated Tries}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {4:1--4:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.4},
URN = {urn:nbn:de:0030-drops-120345},
doi = {10.4230/LIPIcs.AofA.2020.4},
annote = {Keywords: Combinatorics of words, Information Theory, Probabilistic analysis, Analytic combinatorics, Dirichlet generating functions, Sources, Partitions, Trie structure, Continued fraction expansion, Farey map, Sturm words, Transfer operator}
}
@InProceedings{berzunza_et_al:LIPIcs.AofA.2020.5,
author = {Berzunza, Gabriel and Cai, Xing Shi and Holmgren, Cecilia},
title = {{The k-Cut Model in Conditioned Galton-Watson Trees}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {5:1--5:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.5},
URN = {urn:nbn:de:0030-drops-120352},
doi = {10.4230/LIPIcs.AofA.2020.5},
annote = {Keywords: k-cut, cutting, conditioned Galton-Watson trees}
}
@InProceedings{berzunza_et_al:LIPIcs.AofA.2020.6,
author = {Berzunza, Gabriel and Holmgren, Cecilia},
title = {{Largest Clusters for Supercritical Percolation on Split Trees}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {6:1--6:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.6},
URN = {urn:nbn:de:0030-drops-120361},
doi = {10.4230/LIPIcs.AofA.2020.6},
annote = {Keywords: Split trees, random trees, supercritical bond-percolation, cluster size, Poisson measures}
}
@InProceedings{borga_et_al:LIPIcs.AofA.2020.7,
author = {Borga, Jacopo and Maazoun, Micka\"{e}l},
title = {{Scaling and Local Limits of Baxter Permutations Through Coalescent-Walk Processes}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.7},
URN = {urn:nbn:de:0030-drops-120370},
doi = {10.4230/LIPIcs.AofA.2020.7},
annote = {Keywords: Local and scaling limits, permutations, planar maps, random walks in cones}
}
@InProceedings{bousquetmelou_et_al:LIPIcs.AofA.2020.8,
author = {Bousquet-M\'{e}lou, Mireille and Wallner, Michael},
title = {{More Models of Walks Avoiding a Quadrant}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.8},
URN = {urn:nbn:de:0030-drops-120383},
doi = {10.4230/LIPIcs.AofA.2020.8},
annote = {Keywords: Enumerative combinatorics, lattice paths, non-convex cones, algebraic series, D-finite series}
}
@InProceedings{chapon_et_al:LIPIcs.AofA.2020.9,
author = {Chapon, Fran\c{c}ois and Fusy, \'{E}ric and Raschel, Kilian},
title = {{Polyharmonic Functions And Random Processes in Cones}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {9:1--9:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.9},
URN = {urn:nbn:de:0030-drops-120390},
doi = {10.4230/LIPIcs.AofA.2020.9},
annote = {Keywords: Brownian motion in cones, Heat kernel, Random walks in cones, Harmonic functions, Polyharmonic functions, Complete asymptotic expansions, Functional equations}
}
@InProceedings{drmota_et_al:LIPIcs.AofA.2020.10,
author = {Drmota, Michael and Noy, Marc and Stufler, Benedikt},
title = {{Cut Vertices in Random Planar Maps}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {10:1--10:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.10},
URN = {urn:nbn:de:0030-drops-120403},
doi = {10.4230/LIPIcs.AofA.2020.10},
annote = {Keywords: random planar maps, cut vertices, generating functions, local graph limits}
}
@InProceedings{elveyprice_et_al:LIPIcs.AofA.2020.11,
author = {Elvey Price, Andrew and Fang, Wenjie and Wallner, Michael},
title = {{Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {11:1--11:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.11},
URN = {urn:nbn:de:0030-drops-120419},
doi = {10.4230/LIPIcs.AofA.2020.11},
annote = {Keywords: Airy function, asymptotics, directed acyclic graphs, Dyck paths, bijection, stretched exponential, compacted trees, minimal automata, finite languages}
}
@InProceedings{fischer_et_al:LIPIcs.AofA.2020.12,
author = {Fischer, Ilse and Konvalinka, Matja\v{z}},
title = {{The First Bijective Proof of the Alternating Sign Matrix Theorem Theorem}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {12:1--12:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.12},
URN = {urn:nbn:de:0030-drops-120424},
doi = {10.4230/LIPIcs.AofA.2020.12},
annote = {Keywords: enumeration, bijective proof, alternating sign matrix, plane partition}
}
@InProceedings{gao_et_al:LIPIcs.AofA.2020.13,
author = {Gao, Zhicheng and Kang, Mihyun},
title = {{Counting Cubic Maps with Large Genus}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.13},
URN = {urn:nbn:de:0030-drops-120437},
doi = {10.4230/LIPIcs.AofA.2020.13},
annote = {Keywords: cubic maps, triangulations, cubic graphs on surfaces, generating functions, asymptotic enumeration, local limit theorem, saddle-point method}
}
@InProceedings{gnedin_et_al:LIPIcs.AofA.2020.14,
author = {Gnedin, Alexander and Seksenbayev, Amirlan},
title = {{Diffusion Limits in the Online Subsequence Selection Problems}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.14},
URN = {urn:nbn:de:0030-drops-120444},
doi = {10.4230/LIPIcs.AofA.2020.14},
annote = {Keywords: sequential optimisation, longest increasing subsequence, bin packing, fluctuations in the selection process, functional limit}
}
@InProceedings{jacquet_et_al:LIPIcs.AofA.2020.15,
author = {Jacquet, Philippe and Szpankowski, Wojciech},
title = {{Analysis of Lempel-Ziv'78 for Markov Sources}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.15},
URN = {urn:nbn:de:0030-drops-120459},
doi = {10.4230/LIPIcs.AofA.2020.15},
annote = {Keywords: Lempel-Ziv algorithm, digital search trees, depoissonization, analytic combinatorics, large deviations}
}
@InProceedings{jacquet_et_al:LIPIcs.AofA.2020.16,
author = {Jacquet, Philippe and Turowski, Krzysztof and Szpankowski, Wojciech},
title = {{Power-Law Degree Distribution in the Connected Component of a Duplication Graph}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.16},
URN = {urn:nbn:de:0030-drops-120467},
doi = {10.4230/LIPIcs.AofA.2020.16},
annote = {Keywords: random graphs, pure duplication model, degree distribution, tail exponent, analytic combinatorics}
}
@InProceedings{janson_et_al:LIPIcs.AofA.2020.17,
author = {Janson, Svante and Szpankowski, Wojciech},
title = {{Hidden Words Statistics for Large Patterns}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.17},
URN = {urn:nbn:de:0030-drops-120476},
doi = {10.4230/LIPIcs.AofA.2020.17},
annote = {Keywords: Hidden pattern matching, subsequences, probability, U-statistics, projection method}
}
@InProceedings{kang_et_al:LIPIcs.AofA.2020.18,
author = {Kang, Mihyun and Missethan, Michael},
title = {{The Giant Component and 2-Core in Sparse Random Outerplanar Graphs}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.18},
URN = {urn:nbn:de:0030-drops-120488},
doi = {10.4230/LIPIcs.AofA.2020.18},
annote = {Keywords: giant component, core, outerplanar graphs, singularity analysis}
}
@InProceedings{klootwijk_et_al:LIPIcs.AofA.2020.19,
author = {Klootwijk, Stefan and Manthey, Bodo},
title = {{Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.19},
URN = {urn:nbn:de:0030-drops-120494},
doi = {10.4230/LIPIcs.AofA.2020.19},
annote = {Keywords: Random shortest paths, Random metrics, Approximation algorithms, First-passage percolation}
}
@InProceedings{krivelevich_et_al:LIPIcs.AofA.2020.20,
author = {Krivelevich, Michael and M\'{e}sz\'{a}ros, Tam\'{a}s and Michaeli, Peleg and Shikhelman, Clara},
title = {{Greedy Maximal Independent Sets via Local Limits}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.20},
URN = {urn:nbn:de:0030-drops-120507},
doi = {10.4230/LIPIcs.AofA.2020.20},
annote = {Keywords: Greedy maximal independent set, random graph, local limit}
}
@InProceedings{mailler_et_al:LIPIcs.AofA.2020.21,
author = {Mailler, C\'{e}cile and M\"{o}rters, Peter and Senkevich, Anna},
title = {{The Disordered Chinese Restaurant and Other Competing Growth Processes}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {21:1--21:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.21},
URN = {urn:nbn:de:0030-drops-120511},
doi = {10.4230/LIPIcs.AofA.2020.21},
annote = {Keywords: Chinese restaurant process, competing growth processes, reinforced branching processes, preferential attachment tree with fitness, Poisson processes}
}
@InProceedings{neininger_et_al:LIPIcs.AofA.2020.22,
author = {Neininger, Ralph and Straub, Jasmin},
title = {{Convergence Rates in the Probabilistic Analysis of Algorithms}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.22},
URN = {urn:nbn:de:0030-drops-120529},
doi = {10.4230/LIPIcs.AofA.2020.22},
annote = {Keywords: weak convergence, probabilistic analysis of algorithms, random trees, probability metrics}
}
@InProceedings{pearson_et_al:LIPIcs.AofA.2020.23,
author = {Pearson, Antony and Lladser, Manuel E.},
title = {{Hidden Independence in Unstructured Probabilistic Models}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {23:1--23:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.23},
URN = {urn:nbn:de:0030-drops-120538},
doi = {10.4230/LIPIcs.AofA.2020.23},
annote = {Keywords: Bayesian networks, contamination, latent weights, mixture models, independence, symbolic data}
}
@InProceedings{ralaivaosaona_et_al:LIPIcs.AofA.2020.24,
author = {Ralaivaosaona, Dimbinaina and Requil\'{e}, Cl\'{e}ment and Wagner, Stephan},
title = {{Block Statistics in Subcritical Graph Classes}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {24:1--24:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.24},
URN = {urn:nbn:de:0030-drops-120543},
doi = {10.4230/LIPIcs.AofA.2020.24},
annote = {Keywords: subcritical graph class, block statistic, number of blocks, number of edges, number of spanning trees}
}
@InProceedings{ralaivaosaona_et_al:LIPIcs.AofA.2020.25,
author = {Ralaivaosaona, Dimbinaina and Rasendrahasina, Vonjy and Wagner, Stephan},
title = {{On the Probability That a Random Digraph Is Acyclic}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {25:1--25:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-147-4},
ISSN = {1868-8969},
year = {2020},
volume = {159},
editor = {Drmota, Michael and Heuberger, Clemens},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.25},
URN = {urn:nbn:de:0030-drops-120557},
doi = {10.4230/LIPIcs.AofA.2020.25},
annote = {Keywords: Random digraphs, acyclic digraphs, asymptotics}
}
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