22th International Meeting:
Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms
12 – 18 June, 2011, Będlewo
Official Conference webpage
This conference will be the second joint meeting of two previous conference and seminar series on "Mathematics and Computer Science" and "Analysis of Algorithms". The common aim of these and the planned meeting is to study discrete objects that appear as data structures or algorithms (including graphs, networks etc.) by mathematical methods, in particular by probabilistic, combinatorial and asymptotic methods.
- 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
- Analytical 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
Organizing Committee
- Jacek Cichoń (chair)
- Mirosław Kutyłowski
- Zbigniew Gołębiewski
- Rafał Kapelko
- Marek Klonowski
Steering Committee
- Brigitte Chauvin (CNRS, France)
- Luc Devroye (McGill University, Canada)
- Michael Drmota (TU Vienn, Austria)
- Philippe Flajolet (INRIA, France)
- Robert Sedgewick ( Princeton University, USA)
- Wojciech Szpankowski (Purdue University, USA)