Friday, September 9, 2011

[DMANET] First Call for Papers -- AofA 2012

(Apologies for multiple postings)

The 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms will be held at the CRM in Montreal, Canada, on June 17--22, 2012.

http://cg.scs.carleton.ca/~luc/AofA2012.html
http://cg.scs.carleton.ca/~luc/AofA2012--CallForPapers.pdf

**IMPORTANT DATES**
Submission deadline: January 15, 2012.
Notification: March 1, 2012.
Final version: April 1, 2012.

**SCOPE**
Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics. (see http://aofa.cs.purdue.edu/)

We invite papers in
- analytic algorithmics and combinatorics,
- probabilistic analysis of algorithms,
- randomized algorithms.
We welcome papers addressing problems such as: combinatorial algorithms, string searching and pattern matching, sublinear algorithms on massive data sets, network algorithms, graph algorithms, caching and memory hierarchies, indexing, data mining, data compression, coding and information theory, and computational finance. Papers are also welcome that address bridges to research in related fields such as statistical physics, computational biology, computational geometry, and simulation.


**SUBMISSIONS**
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/conferences/?conf=aofa2012.

The proceedings will be published electronically in the DMTCS Proceedings series.

We also draw the attention of the potential participants to special issue of Combinatorics, Probability and Computing in memory of Philippe Flajolet that will be published just after AofA 2012.


**KEYNOTE SPEAKERS**
Michael Drmota (TU Vienna, Austria)
Svante Janson (Uppsala, Sweden)
Amin Coja-Oghlan (Warwick, UK)
Claire Mathieu (Brown, USA)
Avi Wigderson (IAS, USA)


**ORGANIZATION**
Nicolas Broutin, INRIA, France
Luc Devroye, McGill, Canada


**PROGRAM COMMITTEE**
Frédérique Bassino, Paris 13, France
Jit Bose, Carleton, Canada
Nicolas Broutin (co-chair), Inria, France
Philippe Chassaing, Nancy, France
Julien Clément, Caen, France
Luc Devroye (co-chair), McGill, Canada
Uriel Feige, Weizmann, Israel
Alan Frieze, Carnegie-Mellon, USA
Bernhard Gittenberger, TU Vienna, Austria
Hsien-Kuei Hwang, Academia Sinica, Taiwan
Philippe Jacquet, Inria, France
Colin McDiarmid, Oxford, UK
Mike Molloy, Toronto, Canada
Ralph Neininger, Frankfurt, Germany
Marc Noy, Barcelona, Spain
Daniel Panario, Carleton, Canada
Alois Panholzer, TU Vienna, Austria
Bruno Salvy, Inria, France
Mohit Singh, McGill, Canada
Brigitte Vallée, Caen, France
Mark Ward, Purdue, USA


**STEERING COMMITTEE**
Brigitte Chauvin (Versailles, France)
Luc Devroye (McGill, Canada)
Michael Drmota (TU Vienna, Austria)
Daniel Panario (Carleton, Canada)
Robert Sedgewick (Princeton, USA)
Wojciech Szpankowski (Purdue, USA)
Brigitte Vallée (Caen, France)

**SPONSORS**
CRM, Inria, NSERC


**********************************************************
*
* 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/
*
**********************************************************