Analytic Algorithmics and Combinatorics (ANALCO10)

January 16, 2010
Hyatt Regency Austin, Austin, Texas


The list of accepted papers is now available. [PDF, 14KB]

Program Committee

Workshop Co-chairs:
Mordecai Golin, Hong Kong University of Science & Technology, Hong Kong
Robert Sedgewick, Princeton University

SODA Program Committee Liaison:
Wojciech Szpankowski, Purdue University

Philippe Chassaing, Université Henri Poincaré, France
Micha Hofri, Worcester Polytechnic Institute
Hsien-Kuei Hwang, Academia Sinica, Taiwan
Hosam M. Mahmoud, George Washington University
Rajeev Raman, University of Leicester, United Kingdom
Hadas Shachnai, Technion – Israel Institute of Technology, Israel
Brigitte Vallée, Université de Caen, France
Mark Daniel Ward, Purdue University


The Workshop on Analytic Algorithmics and Combinatorics (ANALCO10) will be held on January 16, 2010, at the Hyatt Regency Austin, Austin, Texas.

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 (SODA10), and will take place the day preceding that conference. The workshop is also co-located with the Workshop on Algorithm Engineering and Experimentation (ALENEX10) 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 2010.

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

Friday, October 9, 2009

Monday, December 14, 2009

Monday, December 14, 2009

Donate · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Youtube linkedin google+