Algorithm Engineering and Experiments (ALENEX18), Analytic Algorithmics and Combinatorics (ANALCO18), and the Simplicity in Algorithms Workshop will take place at the same location, and will hold sessions during the SODA conference.
Statement on Inclusiveness
As a professional society, SIAM is committed to providing an inclusive climate that encourages the open expression and exchange of ideas, that is free from all forms of discrimination, harassment, and retaliation, and that is welcoming and comfortable to all members and to those who participate in its activities. In pursuit of that commitment, SIAM is dedicated to the philosophy of equality of opportunity and treatment for all participants regardless of gender, gender identity or expression, sexual orientation, race, color, national or ethnic origin, religion or religious belief, age, marital status, disabilities, veteran status, field of expertise, or any other reason not related to scientific merit. This philosophy extends from SIAM conferences, to its publications, and to its governing structures and bodies. We expect all members of SIAM and participants in SIAM activities to work towards this commitment.
To RSVP to the conference on Facebook and connect with other attendees, find roommates etc., please visit https://www.facebook.com/events/1829265727324784/.
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 #ALENEX18, and ANALCO is #ANALCO18. SIAM’s Twitter handle is @TheSIAMNews.
Program Committee Co-Chairs
Markus Nebel, Universität Bielefeld, Germany
Stephan Wagner, Stellenbosch University, South Africa
Frédérique Bassino, Université Paris Nord, France
Nicolas Broutin, Inria Paris-Rocquencourt, France
Amalia Duch, Universitat Politècnica de Catalunya, Spain
Michael Fuchs, National Chiao Tung University, Taiwan
Clemens Heuberger, Alpen-Adria-Universität Klagenfurt, Austria
Paweł Hitczenko, Drexel University, USA
Emma Yu Jin, Technische Universität Wien, Austria
Michael Mitzenmacher, Harvard University, USA
Daniel Panario, Carleton University, Canada
Alfredo Viola, Universidad de la República, Uruguay
Sebastian Wild, University of Kaiserslautern, Germany
Mark Wilson, University of Auckland, New Zealand
Michael Drmota, Technische Universität Wien, Austria
James Allen Fill (Jim Fill), Johns Hopkins University, USA
H.K. Hwang, Institute of Statistical Science, Academia Sinica, Taiwan
Conrado Martínez, Universitat Politècnica de Catalunya, Spain
Markus Nebel, Universität Bielefeld, Germany
Robert Sedgewick, Princeton University, USA
Wojciech Szpankowski, Purdue University, USA
Mark Daniel Ward, 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 (SODA18). ANALCO is also co-located with Algorithm Engineering and Experimentation (ALENEX18). 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 information will be posted here when available.
August 3, 2017, 11:00 PM GMT - Full Paper Submission
Acceptance/rejection notices will be sent to authors via email in early October 2017.
December 4, 2017: Disconnect time is midnight EST
HOTEL RESERVATION DEADLINE
December 4, 2017