About the Conference

If applying for a visa, please remember to allow ample time for the application process. See Conference Information for information about entering Canada.


The Second Workshop on Analytic Algorithmics and Combinatorics (ANALCO05), will be held in Vancouver, Canada, on January 22, 2005, at the Sheraton Vancouver Wall Center Hotel.

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. This includes average-case analysis; analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms. Submissions that present significant new information about classic algorithms are welcome, as are 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 precedes the ACM-SIAM Symposium on Discrete Algorithms (SODA05), being held January 23-25, 2005.

The workshop will take place on the same day as the Seventh Annual Workshop on Algorithm Engineering and Experimentation (ALENEX05). 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. The proceedings of ALENEX and ANALCO will be published by SIAM as a single volume.

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. Inquiries regarding ANALCO may be sent to workshop organizer Robert Sedgewick at rs@cs.princeton.edu.

The ANALCO workshop is supported by SIAM (Society for Industrial and Applied Mathematics).

Funding Agency

Funding agency information will be posted here as it becomes available.

Program Committee

Brigitte Chauvin, University of Versailles Saint-Quentin-en-Yvelines, France
Philippe Flajolet, INRIA, France
Alan Frieze, Carnegie Mellon University
Michael Mitzenmacher, Harvard University
Daniel Panario, Carleton University, Canada
Nicholas Pippenger, Princeton University
Helmut Prodinger, University of the Witwatersrand, South Africa
Robert Sedgewick (chair), Princeton University
Eli Upfal, Brown University

Plenary Speaker

Analytic Algorithmics, Combinatorics, and Information Theory
Wojciech Szpankowski, Purdue University

Deadline Dates

October 1, 2004


Last Edited: May 13, 2004
DHTML Menus by http://www.milonic.com/