default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th AofA 2024: Bath, UK
- Cécile Mailler
, Sebastian Wild:
35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2024, June 17-21, 2024, University of Bath, UK. LIPIcs 302, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-329-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xii
- Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson:
Fringe Trees for Random Trees with Given Vertex Degrees. 1:1-1:13 - Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun:
Enumeration and Succinct Encoding of AVL Trees. 2:1-2:12 - Wenjie Fang:
Maximal Number of Subword Occurrences in a Word. 3:1-3:12 - Sean S. Svihla, Manuel E. Lladser:
Sparsification of Phylogenetic Covariance Matrices of k-Regular Trees. 4:1-4:17 - Svante Janson, Jérémie O. Lumbroso, Robert Sedgewick:
Bit-Array-Based Alternatives to HyperLogLog. 5:1-5:19 - Marie Albenque, Éric Fusy, Zéphyr Salvy:
Phase Transition for Tree-Rooted Maps. 6:1-6:14 - Cyril Banderier, Markus Kuba, Stephan Wagner, Michael Wallner:
Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models. 7:1-7:18 - Yu-Sheng Chang, Michael Fuchs, Guan-Ru Yu:
Galled Tree-Child Networks. 8:1-8:13 - Jasper Ischebeck, Ralph Neininger:
On Fluctuations of Complexity Measures for the FIND Algorithm. 9:1-9:15 - Fabian Burghart, Stephan Wagner:
A Bijection for the Evolution of B-Trees. 10:1-10:15 - Eva-Maria Hainzl, Élie de Panafieu:
Tree Walks and the Spectrum of Random Graphs. 11:1-11:15 - Torin Greenwood, Samuel Simon:
Asymptotics of Weighted Reflectable Walks in A₂. 12:1-12:14 - Stephan Wagner:
On the Number of Distinct Fringe Subtrees in Binary Search Trees. 13:1-13:11 - Peter Mörters, Nick Schleicher:
Early Typical Vertices in Subcritical Random Graphs of Preferential Attachment Type. 14:1-14:10 - Manosij Ghosh Dastidar, Michael Wallner:
Asymptotics of Relaxed k-Ary Trees. 15:1-15:13 - Anna M. Brandenberger, Byron Chin, Nathan S. Sheffield, Divya Shyamal:
Matching Algorithms in the Sparse Stochastic Block Model. 16:1-16:21 - Amaury Curiel, Antoine Genitrini:
Lexicographic Unranking Algorithms for the Twelvefold Way. 17:1-17:14 - Michael R. Doboli, Hsien-Kuei Hwang, Noah A. Rosenberg:
Periodic Behavior of the Minimal Colijn-Plazzotta Rank for Trees with a Fixed Number of Leaves. 18:1-18:14 - Benjamin Hackl, Stephan Wagner:
Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study. 19:1-19:15 - Sam Olesker-Taylor:
Multicoloured Hardcore Model: Fast Mixing and Its Applications as a Scheduling Algorithm. 20:1-20:14 - Benoît Corsini, Victor Dubach, Valentin Féray:
Binary Search Trees of Permuton Samples. 21:1-21:13 - Shuma Kumamoto, Shuji Kijima, Tomoyuki Shirai:
The Recurrence/Transience of Random Walks on a Bounded Grid in an Increasing Dimension. 22:1-22:15 - Vincent Jugé, June Roupin:
The Alternating Normal Form of Braids and Its Minimal Automaton. 23:1-23:15 - Clemens Heuberger, Daniel Krenn, Tobias Lechner:
Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences. 24:1-24:14 - Louigi Addario-Berry, Pat Morin, Ralph Neininger:
Patricia's Bad Distributions. 25:1-25:8 - Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou, Annika Steibel:
Limit Laws for Critical Dispersion on Complete Graphs. 26:1-26:12 - Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger, Noah A. Rosenberg:
Asymptotic Enumeration of Rooted Binary Unlabeled Galled Trees with a Fixed Number of Galls. 27:1-27:14 - James Allen Fill, Daniel Q. Naiman, Ao Sun:
Sharpened Localization of the Trailing Point of the Pareto Record Frontier. 28:1-28:21 - Stephan Wagner, Mei Yin:
Statistics of Parking Functions and Labeled Forests. 29:1-29:14 - Philippe Jacquet, Svante Janson:
Depth-First Search Performance in Random Digraphs. 30:1-30:15
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 2025-01-09 12:00 CET 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:
