Thursday, January 11, 2018

[DMANET] Call for Papers for AofA 2018

Call for Papers

29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms (AofA 2018)

Uppsala, Sweden,  June 25-29, 2018

The 29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods
for the Analysis of Algorithms will be held in Uppsala, Sweden, June
25-29, 2018. The website of the event is .

Program Committee:

    Olivier Bodini, Paris 13, France
    Michael Drmota, TU Vienna, Austria
    James Allen Fill (chair), Johns Hopkins Univ., USA
    Antoine Genitrini, Paris 6, France
    Zbigniew Golebiewski, Wroclaw U. Sci. Tech., Poland
    Cecilia Holmgren, Uppsala U., Sweden
    Hsien-Kuei Hwang, Academic Sinica, Taiwan
    Svante Linusson, KTH, Sweden
    Manuel Lladser, U. Colorado, USA
    Cécille Mailler, Univ. Bath, UK
    Markus Nebel, TU Kaiserslautern, Germany
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Daniel Panario, Carleton Univ., Canada
    Bruno Salvy, INRIA Lyon, France
    Robert Sedgewick, Princeton Univ., USA
    Wojciech Szpankowski, Purdue Univ., USA
    Stephan Wagner, Stellenbosch Univ., South Africa
    Mark Daniel Ward, Purdue Univ., USA

Steering Committee:

    Nicolas Broutin, INRIA Rocquencourt, France
    Hsien-Kuei Hwang, Academia Sinica, Taiwan
    Conrado Martinez, UPC Barcelona, Spain
    Ralph Neininger, Goethe-U Frankfurt, Germany
    Robert Sedgewick (chair), Princeton Univ., USA
    Michèle Soria, Paris 6, France


    Cecilia Holmgren, Uppsala University, Sweden
    James Allen Fill, Johns Hopkins University, USA (


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
predict precisely 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 .

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.

Keynote speakers (confirmed):

    Louigi Addario-Berry, McGill University, Canada
    Béla Bollobás, Univ. of Cambridge, UK and Univ. of Memphis, USA
    Karen Gunderson, University of Manitoba, Canada
    Olle Häggström, Chalmers University of Technology, Sweden
    Svante Janson, Uppsala University, Sweden
    Mihyun Kang, Graz University of Technology, Austria
    Mark Daniel Ward, Purdue University, USA

Flajolet Award Lecture:

    Luc Devroye, McGill University, Canada


We invite you to submit an extended abstract (12 pages) or a short
abstract for a poster (2 pages) via the EasyChair system: .

The proceedings will be published electronically.  Authors of selected
accepted papers will be invited to submit their contributions to a
special issue in a leading journal (to be determined).

Important dates:

    Submission deadline: February 8, 2018
    Notification: April 8, 2018
    Final version: May 8, 2018

If you intend to submit a paper, please consider submitting a title and
a short abstract early.
* Contributions to be spread via DMANET are submitted to
* 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.