Workshop Co-chairs:

Philippe Flajolet, INRIA Rocquencourt, France
Daniel Panario, Carleton University, Canada
Program Committee

Luc Devroye, McGill University, Canada
Eric Fusy, Ecole Polytechnique, France
Zhicheng (Jason) Gao, Carleton University, Canada
Michael T. Goodrich, University of California - Irvine, USA
Hsien-Kuei Hwang, Academia Sinica, Taiwan
Manuel Lladser, The University of Colorado, USA
Colin McDiarmid, University of Oxford, England
Marni Mishna, Simon Fraser University, Canada
Markus Nebel, University of Kaiserslautern, Germany
Brigitte Vallee, Universite de Caen, France
Description

The Workshop on Analytic Algorithmics and Combinatorics (ANALCO11) will be held on January 22, 2011, at the Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA.

The aim of the ANALCO workshop is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; probabilistic analysis of randomized algorithms, and so on. Submissions that present significant new information about classic algorithms are welcome, as are new analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational.

The scientific program will include invited talks, contributed research papers, and ample time for discussion and debate of topics in this area.

This workshop is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA11), and will take place the day preceding that conference. The workshop is also co-located with the Workshop on Algorithm Engineering and Experimentation (ALENEX11) and will take place on the same day. Since researchers in both fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop.

Registrants from either workshop will be cross-registered with the other. Proceedings of ALENEX and ANALCO will be available online in January 2011.

A paper that has been reviewed and accepted for presentation at SODA is not eligible for submission to ANALCO. We recognize, however that some research projects spawn multiple papers that elaborate on different aspects of the work and are willing to respond to inquiries about SODA, ALENEX, and ANALCO papers that may overlap. Papers of interest to both the ALENEX and the ANALCO communities are particularly encouraged. Such papers may be submitted to either workshop and will, as appropriate, be presented in a joint session.
The ANALCO workshop is supported by SIAM (Society for Industrial and Applied Mathematics).
Important Deadlines

SUBMISSION DEADLINE
October 4, 2010

PRE-REGISTRATION DEADLINE
December 20, 2010

HOTEL RESERVATION DEADLINE
December 20, 2010