If applying for a Visa, please remember to allow ample time for the application process. See “Conference Information” for a link to the National Academies who can provide further information.


The Eighth Workshop on Algorithm Engineering and Experiments (ALENEX06) will be held in Miami, Florida, on January 21, 2006, at the Radisson Hotel Miami Downtown.

The aim of the ALENEX workshop is to provide a forum for presentation of original research in the implementation and experimental evaluation of algorithms and data structures. We invite submissions that present significant case studies in experimental analysis (such studies may tighten, extend, or otherwise improve current theoretical results) or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios, including specific applied areas (including databases, networks, operations research, computational biology and physics, computational geometry, and the world wide web) that present unique challenges in their underlying algorithmic problems. We also invite submissions that address methodological issues and standards in the context of empirical research on algorithms and data structures. The scientific program will include time for discussion and debate of topics in this rapidly evolving research area.

This workshop precedes the ACM-SIAM Symposium on Discrete Algorithms (SODA06), being held January 22-24, 2006.

The workshop will take place on the same day as the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO06). 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. The proceedings of ALENEX and ANALCO will be published as a single volume. Attendees will be permitted to attend sessions in either workshop.

A paper that has been reviewed and accepted for presentation at SODA is not eligible for submission to ALENEX. 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. Inquiries regarding ALENEX may be sent to workshop organizers Matt Stallman ([email protected]) or Rajeev Raman ([email protected]).

The workshop is supported by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory


Funding information will be available in the future.

Program Committee

Ricardo Baeza-Yates, UPF, Barcelona, Spain and University of Chile, Santiago
Luciana Buriol, University of Rome “La Sapienza”, Italy
Thomas Erlebach, University of Leicester, United Kingdom
Irene Finocchi, University of Rome “La Sapienza”, Italy
Roberto Grossi, University of Pisa, Italy
Lutz Kettner, Max Planck Institute for Informatics, Saarbrücken, Germany
Eduardo Sany Laber, PUC, Rio de Janeiro, Brazil
Alex Lopez-Ortiz, University of Waterloo, Canada
Stefan Näher, University of Trier, Germany
Rajeev Raman (co-chair), University of Leicester, United Kingdom
Peter Sanders, University of Karlsruhe, Germany
Matt Stallmann (co-chair), North Carolina State University
Ileana Streinu, Smith College
Thomas Willhalm, Intel, Germany


DHTML Menus by http://www.milonic.com/