This meeting is co-sponsored by Universitat Politècnica de Catalunya, Barcelona, Spain.

The meeting is being held with:
ACM-SIAM Symposium on Discrete Algorithms (SODA17)
January 16-19, 2017

Algorithm Engineering and Experiments (ALENEX17)
January 17-18, 2017

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.



All sessions and on-site registration will occur at the Hotel Porta Fira:
Hotel Porta Fira
Plaza Europa, 45
08908 Hospitalet de Llobregat
Barcelona, Spain
Telephone: +34 932 973 500


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 #ALENEX17, and ANALCO is #ANALCO17.

Program Committee Co-Chairs

Conrado Martínez, Universitat Politècnica de Catalunya, Spain
Mark Daniel Ward, Purdue University, USA

Local Conference Chair

Conrado Martínez, Universitat Politècnica de Catalunya, Spain
Email: [email protected]

Program Committee

Olivier Bodini, CNRS, LIPN, Université Paris Nord, France
Mireille Bousquet-Mélou, CNRS, Université de Bordeaux, France
Elie de Panafieu, Bell Labs France, Nokia, France
Luc Devroye, McGill University, Canada
Martin Dietzfelbinger, Technische Universität Ilmenau, Germany
Bernhard Gittenberger, Technische Universität Wien, Austria
Cecilia Holmgren, Uppsala Universitet, Sweden
Mihyun Kang, Technische Universität Graz, Austria
Marni Mishna, Simon Fraser University, Canada
Cyril Nicaud, LIGM, Université Paris Est, France
Marc Noy, Universitat Politècnica de Catalunya, Spain
Dana Randall, Georgia Institute of Technology, USA

Steering Committee

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, University of Kaiserslautern, 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 (SODA17). ANALCO is also co-located with Algorithm Engineering and Experimentation (ALENEX17). 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 Agencies

Funding agency information will be posted here when available.


Important Deadlines

July 13, 2016, 11:00 PM GMT
Acceptance/rejection notices will be sent to authors via email in early October 2016.

Early registration: October 16, 2016 EXTENDED to November 11, 2016
Regular Registration: December 30, 2016
Onsite Registration: January 16-19, 2017

November 14, 2016

October 16, 2016


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