AofA'15 26th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms

26th International Meeting on
Probabilistic, Combinatorial and Asymptotic
Methods for the Analysis of Algorithms

Strobl, Austria
June 8-12, 2015

Program

Here you can find the abstract book of AofA'15.

9:00 - 10:00

Martin Dietzfelbinger, Analysis of Quicksort with more than one pivot

10:30 - 12:30

Jim Fill, Limiting distributions for QuickVal residuals, for key comparisons and symbol comparisons: scale mixtures of Gaussian laws
Uwe Roesler, The weighted branching process and the Quicksort process
Martin Aumueller, Strong randomness properties of (hyper-)graphs generated by simple hash functions
Michael Fuchs, The node profile of symmetric digital search trees

13:00 Lunch
15:00 - 16:00

Christina Goldschmidt, A line-breaking construction of the stable trees

16:30 - 18:30

Rudolf Gruebel, A functional central limit theorem for branching random walks, with applications to Quicksort asymptotics
Stephan Wagner, The number of spanning trees of random 2-trees
Zakhar Kabluchko, Edgeworth expansions for branching random walks and random trees
Irene Marcovici, Uniform sampling of subshifts of finite type

19:00 Dinner

9:00 - 10:00

Elchanan Mossel, The surprising power of belief propagation

10:30 - 12:30

Hsien-Kuei Hwang, Generation of random permutations: algorithms and analysis (Part I)
Axel Bacher, Generation of random permutations: algorithms and analysis (Part II)
Torin Greenwood, Asymptotics of the coefficients of bivariate analytic functions with algebraic singularities
Cyril Banderier, Some unusual asymptotics for a variant of insertion sort
Louigi Addario-Berry, Most trees are short and fat

13:00 Lunch
15:00 - 16:00

Lutz Warnke, The phase transition in Achlioptas processes

16:30 - 18:...

Michael Bradonjic, Large scaling laws for maximum coloring of sparse random geometric graphs
Cecile Mailler, Condensation and symmetry-breaking in the zero-range process with weak site disorder
Clemens Heuberger, Analysis of bidirectional ballot sequences and random walks ending in their maximum
Business meeting

19:00 Dinner

9:00 - 10:00

Carsten Schneider, Symbolic summation for combinatorial and related problems

10:30 - 12:00

Pablo Rotondo, Recurrence function for sturmian words: probabilistic studies (Part I)
Brigitte Vallee, Recurrence function for sturmian words: probabilistic studies (Part II)
Eda Cesaratto, Metrical versions of the two distances theorem

12:00 Lunch
13:00 Trip to Hallstatt
19:00 Dinner

9:00 - 10:00

Nicolas Broutin, Universality of scaling limits of critical random graphs

10:30 - 12:30

Mihyun Kang, Characterisation of symmetries of unlabelled triangulations
Michael Mosshammer, Enumeration of cubic multigraphs on orientable surfaces
Hosam Mahmoud, Issues in random networks: the Apollonian network as a case study
Elie de Panafieu, Graphs with degree constraints

13:00 Lunch
15:00 - 16:00

Markus Nebel, Analytic Combinatorics in Biology

16:30 - 18:30

Wojciech Szpankowski, Profile of PATRICIA Tries
Daniele Gardy, B-trees and Polya urns
Cecilia Holmgren, Using Polya urns to prove normal limit laws for protected nodes in m-ary search trees
Markus Kuba, Limit distributions for urn models with multiple drawings

19:00 Conference dinner

9:00 - 10:00

Alois Panholzer, Examples of two-parameter recurrences and their treatments

10:30 - 12:00

Zbigniew Golebiewski, Analysis of the natural counting of lambda-terms
Daniel Krenn, Analysis of parameters of multi-base representations of an integer
Sara Kropf, Combinatorial characterization of transducers with bounded variance

12:30 Lunch