Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st AofA 2020: Klagenfurt, Austria
- Michael Drmota
, Clemens Heuberger:
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, June 15-19, 2020, Klagenfurt, Austria (Virtual Conference). LIPIcs 159, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-147-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Andrei Asinowski, Cyril Banderier:
On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution. 1:1-1:16 - Cyril Banderier, Marie-Louise Lackner, Michael Wallner:
Latticepathology and Symmetric Functions (Extended Abstract). 2:1-2:16 - Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello:
The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings. 3:1-3:15 - Valérie Berthé, Eda Cesaratto, Frédéric Paccaut, Pablo Rotondo, Martín D. Safe, Brigitte Vallée:
Two Arithmetical Sources and Their Associated Tries. 4:1-4:19 - Gabriel Berzunza Ojeda, Xing Shi Cai, Cecilia Holmgren:
The k-Cut Model in Conditioned Galton-Watson Trees. 5:1-5:10 - Gabriel Berzunza Ojeda, Cecilia Holmgren:
Largest Clusters for Supercritical Percolation on Split Trees. 6:1-6:10 - Jacopo Borga, Mickaël Maazoun:
Scaling and Local Limits of Baxter Permutations Through Coalescent-Walk Processes. 7:1-7:18 - Mireille Bousquet-Mélou, Michael Wallner:
More Models of Walks Avoiding a Quadrant. 8:1-8:14 - François Chapon, Éric Fusy, Kilian Raschel:
Polyharmonic Functions And Random Processes in Cones. 9:1-9:19 - Michael Drmota, Marc Noy, Benedikt Stufler:
Cut Vertices in Random Planar Maps. 10:1-10:18 - Andrew Elvey Price, Wenjie Fang, Michael Wallner:
Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language. 11:1-11:13 - Ilse Fischer, Matjaz Konvalinka:
The First Bijective Proof of the Alternating Sign Matrix Theorem Theorem. 12:1-12:12 - Zhicheng Gao, Mihyun Kang:
Counting Cubic Maps with Large Genus. 13:1-13:13 - Alexander V. Gnedin, Amirlan Seksenbayev:
Diffusion Limits in the Online Subsequence Selection Problems. 14:1-14:15 - Philippe Jacquet, Wojciech Szpankowski:
Analysis of Lempel-Ziv'78 for Markov Sources. 15:1-15:19 - Philippe Jacquet, Krzysztof Turowski, Wojciech Szpankowski:
Power-Law Degree Distribution in the Connected Component of a Duplication Graph. 16:1-16:14 - Svante Janson, Wojciech Szpankowski:
Hidden Words Statistics for Large Patterns. 17:1-17:15 - Mihyun Kang, Michael Missethan:
The Giant Component and 2-Core in Sparse Random Outerplanar Graphs. 18:1-18:16 - Stefan Klootwijk, Bodo Manthey:
Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics. 19:1-19:16 - Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman:
Greedy Maximal Independent Sets via Local Limits. 20:1-20:19 - Cécile Mailler, Peter Mörters, Anna Senkevich:
The Disordered Chinese Restaurant and Other Competing Growth Processes. 21:1-21:13 - Ralph Neininger, Jasmin Straub:
Convergence Rates in the Probabilistic Analysis of Algorithms. 22:1-22:13 - Antony Pearson, Manuel E. Lladser:
Hidden Independence in Unstructured Probabilistic Models. 23:1-23:13 - Dimbinaina Ralaivaosaona, Clément Requilé, Stephan Wagner:
Block Statistics in Subcritical Graph Classes. 24:1-24:14 - Dimbinaina Ralaivaosaona, Vonjy Rasendrahasina, Stephan Wagner:
On the Probability That a Random Digraph Is Acyclic. 25:1-25:18
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-08-14 22:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
