Aofa 2016

27th International Conference on Probabilistic, Combinatorial
and Asymptotic Methods for the Analysis of Algorithms
Kraków, Poland, July 4–8, 2016

Accepted papers

Authors Paper
Maxim Arnold, Yuliy Baryshnikov and Yuriy Mileyko Typical representatives of free homotopy classes in a multi-punctured plane
Nicolas Auger, Mathilde Bouvel, Cyril Nicaud and Carine Pivoteau Analysis of Algorithms for Permutations Biased by Their Number of Records
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn and Helmut Prodinger Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort
Jacek Cichoń, Rafał Kapelko, Dominik Markiewicz On Leader Green Election
Gwendal Collet, Michael Drmota and Lukas Klausner Vertex Degrees in Planar Maps
Jean-François Delmas, Jean-Stéphane Dhersin and Marion Sciauveau Cost functionals for large random trees
Michael Drmota, Abram Magner and Wojciech Szpankowski Asymmetric Renyi Problem and PATRICIA Tries
Michael Drmota and Mehdi Javanian Solutions of First Order Linear Partial Differential Equations and Central Limit Theorems
Sandro Franceschi, Kilian Raschel and Irina Kourkova Analytic approach for reflected Brownian motion in the quadrant
Michael Fuchs and Hsien-Kuei Hwang Dependence between External Path-Length and Size in Random Tries
Jeffrey Gaither and Mark Daniel Ward Variance of the Internal Profile in Suffix Trees
Zhicheng Gao and Edward Bender Locally Restricted Sequential Structures and Runs of a Subcomposition in Integer Compositions
Antoine Genitrini Full asymptotic expansion for Polya structures
Benjamin Hackl, Clemens Heuberger and Daniel Krenn Asymptotic Expansions in SageMath
Benjamin Hackl, Clemens Heuberger and Helmut Prodinger The Register Function and Reductions of Binary Trees and Lattice Paths
Clemens Heuberger and Sara Kropf On the Higher Dimensional Quasi-Power Theorem and a Berry-Esseen Inequality
Pawel Hitczenko and Amanda Lohss Probabilistic consequences of some polynomial recurrences
Cecilia Holmgren, Svante Janson and Matas Sileikis Using Pólya urns to show normal limit laws for fringe subtrees in m-ary search trees
Philippe Jacquet and Wojciech Szpankowski Average Size of a Suffix Tree for Markov Sources
Mihyun Kang and Tamas Makai Bootstrap percolation on G(n,p) revisited
Sara Kropf and Stephan Wagner q-Quasiadditive Functions
Markus Kuba and Alois Panholzer Combinatorial analysis of growth models for series-parallel networks
Amanda Lohss and Pawel Hitczenko Corners in Tree--Like Tableaux
Eugenijus Manstavicius and Vytautas Stepas Variance of additive functions defined on random assemblies
Robertas Petuchovas Recent results on permutations without short cycles
Patricio Poblete and Alfredo Viola Robin Hood Hashing really has constant average search cost and variance in full tables
Dimbinaina Ralaivaosaona and Stephan Wagner Additive functionals of d-ary increasing trees
Vonjy Rasendrahasina, Andry Rasoanaivo and Vlady Ravelomanana The Maximum Block Size of Critical Random Graphs
Takeharu Shiraga The Cover Time of Deterministic Random Walks for General Transition Probabilities
Michael Wallner A half-normal distribution scheme for generating functions and the unexpected behavior of Motzkin paths
Vytas Zacharovas On the exponential decay of the characteristic function of the quicksort distribution

Background image - Kraków Cathedral © Michela Simoncini