Announcements
To RSVP to the conference on Facebook and connect with other attendees, find roommates etc., please go to the link below:
http://www.facebook.com/event.php?eid=205034719518515#!/SIAMconnect.
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 #ALENEX12 and ANALCO is #ANALCO12.
Program Committee Co-chairs:
Conrado Martínez, Universitat Politècnica de Catalunya, Spain
Hsien-Kuei Hwang, Academia Sinica, Taiwan
Program Committee
Alexander Gnedin, Utrecht University, The Netherlands
Ralph Neininger, University of Frankfurt, Germany
Daniel Panario, Carleton University, Canada
Alois Panholzer, Technische Universität Wien, Austria
Dana Randall, Georgia Institute of Technology, USA
Vlady Ravelomanana, Université Paris 7, France
Michèle Soria, Université Paris 6, France
Stephan Wagner, Stellenbosch University, South Africa
Osamu Watanabe, Tokyo Institute of Technology, Japan
Description
Analytic Algorithmics and Combinatorics (ANALCO12) will be held on January 16, 2012, at The Westin Miyako, Kyoto, Japan.
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 is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA12), and will take place the day preceding that conference. ANALCO is also co-located with Algorithm Engineering and Experimentation (ALENEX12) 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 ALENEX and ANALCO will be cross-registered with the other. Proceedings of ALENEX and ANALCO will be available online in January 2012.
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 meeting and will, as appropriate, be presented in a joint session.
ANALCO is supported by SIAM (Society for Industrial and Applied Mathematics).Important Deadlines
SUBMISSION DEADLINES
October 3, 2011 Deadline Extended to October 10, 2011
PRE-REGISTRATION DEADLINE
December 20, 2011 (The registration system will close at midnight, Japan time)
HOTEL RESERVATION DEADLINE
December 17, 2011
