Site best viewed with IE 6.0, Netscape 6.0, or Mozilla 1.4 or better


 

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 (SODA04) being held January 11-13, 2004.

The workshop will take place on the same day as the 1st Workshop on Analytic Algorithmics and Combinatorics (ANALCO04) and will take place on the same day as that conference. The proceedings of ALENEX and ANALCO will be published as a single volume.

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. We are willing to respond to inquiries about SODA, ALENEX, and ANALCO papers that may overlap. Inquires regarding ALENEX may be sent to workshop organizers Lars Arge or Giusuppe Italiano at large@cs.duke.edu and italiano@disp.uniroma2.it.

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.

Authors are invited to submit 10-page extended abstracts by 5:00 PM EDT, SEPTEMBER 19, 2003 (strict deadline) and must use the SIGACT electronic submissions server.

Click HERE to submit.

Notification of acceptance or rejection will be sent by the end of November 2003. Details of the final paper submission process will be included with acceptance notifications. The deadline for receipt of papers in final version is January 5, 2004.

Presenters must have submitted the final versions of their papers in order to be able to present them at the workshop.

Program Committee:

Lars Arge, Duke University (co-chair)
Jon Bentley, Avaya Labs Research
Mark de Berg, Technische Universiteit Eindhoven, The Netherlands
Monika Henzinger, Google, Inc.
Giuseppe F. Italiano, University of Rome, Italy (co-chair)
David Karger, Massachusetts Institute of Technology
Ulrich Meyer, Max-Planck-Institut fur Informatik, Germany
Jan Vahrenhold, University of Munster, Germany

Important dates:

Submission of Papers Deadline
September 19, 2003

Acceptance Notification
End of November 2003

Final Paper Due
January 5, 2004

Invited Plenary Speaker

Engineering Geometric Algorithms: Persistent Problems and Some Solutions
Dan Halperin, Tel Aviv University

For more information:

Contact workshop organizers Lars Arge or Giusuppe Italiano at large@cs.duke.edu and italiano@disp.uniroma2.it

You may also contact SIAM at meetings@siam.org

Audio/Visual Notice

http://www.siam.org/meetings/resources/avnotice.htm


12/8/03