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 on the first day of the ACM-SIAM Symposium on Discrete Algorithms (SODA13). ANALCO is also co-located with Algorithm Engineering and Experimentation (ALENEX13). 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.
SPECIAL NOTICE: ANALCO will be offered as a fourth "track" on the first day of SODA (January 6, 2013). The ANALCO and ALENEX programs will be integrated with the SODA program and all papers will be available online before the conference. Accordingly, please note that the ANALCO deadline has been moved to August 1, 2012.