Strobl, Austria
June 8-12, 2015

• Overview
• Steering Committee
• Organizing Committee

AofA'15 will be the 26th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, the sixth edition after the merging of the International Conference on the Analysis of Algorithms (AofA) and the Colloquium on Mathematics and Computer Science (MathInfo) series. In this edition the meeting has closed format, meaning that participation is by invitation only. On even-numbered years, the meeting has open format, with open registration, call for papers and published proceedings. The next open meeting will be in Cracow, Poland on July 4-8 2016, with call for papers in early 2016.

The main goal of the meeting is to exchange ideas and foster collaboration around the themes of analytic, combinatorial and probabilistic methods, randomized algorithms, and theoretical aspects of trees, graphs, strings and other mathematical structures. Topics include

• Properties of large randomly formed data structures
• Probabilistic methods for the analysis of algorithms
• Combinatorial methods for the analysis of algorithms
• Analytic tools for the analysis of algorithms
• New results concerning average case analysis of classical or new algorithms
• Analytic and enumerative combinatorics
• Random trees and graphs
• Branching processes
• Stochastic processes in relation with random discrete structures
• Random walks
• Discrete probabilities
• Random generation of combinatorial structures
• Data compression and language-modeling methods
• Performance evaluation

Steering Committee

• Bob Sedgewick (Chair)
• Nicolas Broutin
• Michael Drmota
• Conrado Martinez
• Michèle Soria
• Brigitte Vallée

Organizing Committee

• Bernhard Gittenberger (Chair)
• Marie-Louise Bruner
• Gwendal Collet
• Michael Drmota
• Zbigniew Gołębiewski
• Alois Panholzer
• Michael Wallner