The meeting is being held with:
Algorithm Engineering and Experiments (ALENEX14)
January 5, 2014
ACM-SIAM Symposium on Discrete Algorithms (SODA14)
January 5-7, 2014
Philippe Flajolet School on Analytic Combinatorics and the Analysis of Algorithms
January 7, 2014


To RSVP to the conference on Facebook and connect with other attendees, find roommates etc., please visit

If you are tweeting about the conference, please use the designated hashtag to enable other attendees to keep up with the Twitter conversation and to allow better archiving of our conference discussions. The hashtag for ALENEX is #ALENEX14, and ANALCO is #ANALCO14.


Program Committee

Program Committee Co-Chairs
Michael Drmota, Technische Universität Wien, Austria
Mark Daniel Ward, Purdue University, USA

Miklos Bona, University of Florida, USA
Cecilia Holmgren, Stockholms Universitet, Sweden
Marcos Kiwi, Universidad de Chile, Chile
Markus Nebel, University of Kaiserslautern, Germany
Alois Panholzer, Technische Universität Wien, Austria
Robin Pemantle, University of Pennsylvania, USA
Bob Sedgewick, Princeton University, USA
Mark Wilson, University of Auckland, New Zealand

Steering Committee

H.K. Hwang, Institute of Statistical Science, Academia Sinica, Taiwan
Conrado Martínez, Universitat Politècnica de Catalunya, Spain
Markus Nebel, University of Kaiserslautern, Germany
Daniel Panario, Carleton University, Canada
Robert Sedgewick, Princeton University, USA
Wojciech Szpankowski, Purdue University, USA



The aim of ANALCO 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. ANALCO will be held during the ACM-SIAM Symposium on Discrete Algorithms (SODA14). ANALCO is also co-located with Algorithm Engineering and Experimentation (ALENEX14). 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.

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


Funding Agency

Funding agency information will be posted here when available.


Important Deadlines

July 31, 2013 August 15, 2013 (11:00 PM GMT) – DEADLINE EXTENDED

December 2, 2013: Disconnect time is 4:00 PM EST

December 2, 2013

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