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.
A Facebook link to RSVP to the conference, connect with other attendees and find roommates will be posted here in October 2012.
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 #ALENEX13 and ANALCO is #ANALCO13.
The meeting is being held with:
ACM-SIAM Symposium on Discrete Algorithms
January 6-8, 2013
Algorithm Engineering and Experiments (ALENEX13)
January 7, 2013
Program Committee Co-Chairs
- Markus Nebel, University of Kaiserslautern (Germany)
- Wojciech Szpankowki, Purdue University (USA)
- Jacek Cichon, Wroclaw University of Technology (Poland)
- Amin Coja-Oghlan, University of Warwick (United Kingdom)
- Michael Drmota, Technische Universität Wien (Austria)
- Mordecai Golin, Hong Kong University of Science & Technology (Hong Kong)
- Alan Frieze, Carnegie Mellon University (USA)
- Hosam Mahmoud, The George Washington University (USA)
- Christian Reidys, University of Southern Denmark Odense (Denmark)
- Bruno Salvy, INRIA Rocquencourt (France)