AOFA '10
21st International Meeting on
Probabilistic, Combinatorial, and Asymptotic
Methods for the Analysis of Algorithms
Vienna University of Technology (AUSTRIA)
June 28-July 2, 2010
with a Mini-Summerschool from
June 25-26, 2010
Scope
-----
This conference is the first 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 present 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
Invited talks
-------------
The following speakers confirmed to give an invited talk:
Noga Alon (Tel Aviv University)
Yuliy Baryshnikov (Bell Laboratories)
Daniel Panario (Carleton University)
Oliver Riordan (University of Oxford)
Peter Winkler (Dartmouth)
Tutorial talks of the Mini-Summerschool (June 25-26)
----------------------------------------------------
Nicolas Broutin (INRIA Rocquencourt)
Christian Krattenthaler (University of Vienna)
N.N.
Wojciech Szpankowski (Purdue University)
Submission of papers
--------------------
We invite you to submit an extended abstract (12 pages) or a short abstract for
a poster (2 pages) via the Easy-Chair system:
https://www.easychair.org/login.cgi?conf=aofa10
The deadline for submission of papers is
February 28, 2010,
for posters
May 31, 2010.
It is planned to publish the proceedings in DMTCS.
Steering committee
------------------
Brigitte Chauvin, Versailles (France)
Luc Devroye, Montreal (Canada)
Michael Drmota, Vienna (Austria)
Philippe Flajolet, INRIA Rocquencourt (France)
Robert Sedgewick, Princeton (USA)
Wojciech Szpankowski, Purdue (USA)
Programme committee
-------------------
Brigitte Chauvin, Versailles (France)
Jacek Cichon, Wroclaw (Poland)
Michael Drmota, Vienna (Austria), Chair
Daniele Gardy, Versailles (France)
Philippe Flajolet INRIA Rocquencourt (France)
Martin Klazar, Prague (Czech Republic)
Jean Francois LeGall, Paris (France)
Ralph Neininger, Frankfurt (Germany)
Marc Noy, Barcelona (Spain)
Conrado Martinez, Barcelona (Spain)
Alois Panholzer, Vienna (Austria)
Helmut Prodinger, Stellenbosch (South Africa)
Uwe Roesler, Kiel (Germany)
Bob Sedgewick, Princeton (USA)
Peter Winkler, Dartmouth (USA)
Wojciech Szpankowski, Purdue (USA)
Organizing committee
--------------------
Michael Drmota
Bernhard Gittenberger (Chair)
Alois Panholzer
Important dates
---------------
February 28, 2010 deadline for submission
April 30, 2010 notification to authors
May 31, 2010 final version of accepted papers
and deadline for poster submissions
Official language English.
-----------------
Address
-------
Vienna University of Technology, Dept. of Discrete Mathematics and Geometry,
Wiedner Hauptstr. 8-10/104, A-1040 Wien (Austria)
e-mail : aofa10@dmg.tuwien.ac.at
Web site: www.aofa10.at
The Organizers
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
