Thursday, January 21, 2016

[DMANET] CFP: 27th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms

Dear Colleagues,

The CFP for the 27th International Conference on Probabilistic,
Combinatorial, and Asymptotic Methods for the Analysis of Algorithms is
available. The conference takes place July 4-8, 2016, in Krakow, Poland.

The conference website is here: http://www.aofa2016.meetings.pl/

It aims at studying discrete objects that appear as data structures or
algorithms (including graphs, networks etc.) by mathematical methods, in
particular by probabilistic, combinatorial and asymptotic methods.

Important dates:
Submission deadline: February 12, 2016.
Notification: April 22, 2016.
Final version: May 13, 2016.
Early registration: May 13, 2016.

Confirmed keynote speakers:
Jean Bertoin, Zurich Univ., Switzerland
Paweł Błasiak, Polish Academy of Sciences, Krakow, Poland
Hsien-Kuei Hwang, Academia Sinica, Taipeh, Taiwan
Bob Sedgewick, Princeton Univ., USA - FLAJOLET LECTURE
Wojtek Szpankowski, Purdue Univ., USA
Nick Wormald, Monash Univ., Australia

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 also 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.


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