ALENEX 2009
Jump to navigation
Jump to search
Event Rating
| median | worst |
|---|---|
|
|
List of all ratings can be found at ALENEX 2009/rating
| ALENEX 2009 | |
|---|---|
11th Workshop on Algorithm Engineering and Experiments
| |
| Dates | Jan 3, 2009 (iCal) - Jan 3, 2009 |
| Homepage: | www.siam.org/meetings/alenex09 |
| Location | |
| Location: | New York, USA |
| Important dates | |
| Submissions: | Oct 1, 2008 |
| Table of Contents | |
************************************************************************
11th Workshop on Algorithm Engineering and Experiments
ALENEX 2009 - CALL FOR PAPERS
January 3, 2009
New York City, New York
http://www.siam.org/meetings/alenex09/
************************************************************************
SCOPE
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 (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.
The workshop is supported by SIAM (Society for Industrial and Applied Mathematics) and by SIGACT (ACM Special Interest Group on Algorithms and Computation Theory). It precedes the ACM-SIAM Symposium on Discrete Algorithms (SODA09), being held on January 4-6, 2009, and takes place on the same day as the Workshop on Analytic Algorithmics and Combinatorics (ANALCO09). 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.
IMPORTANT DATES
Deadline for submission: October 1, 2008
Notification to authors: mid-November, 2008
Final version: mid-December, 2008
Workshop: January 3, 2009
SUBMISSIONS
Authors are invited to submit an extended abstract electronically by October 1, 2008 (11:59 EDT PM, strict deadline). The electronic submission server is at:
http://www.easychair.org/conferences/?conf=alenex09
The abstract must consist of at most 10 pages. Results omitted due to space constraints can be put into a clearly marked appendix, which will be read at the discretion of the program committee. Simultaneous submission to other conferences with published proceedings is not allowed.
The proceedings of ALENEX will be published openly and electronically by SIAM. A special issue of the ACM Journal of Experimental Algorithmics (JEA) will be dedicated to selected papers from ALENEX09. Authors of accepted papers are also strongly encouraged to submit publicly available code and data to JEA Research Code Repository (http://www.jea.acm.org/repository/).
PROGRAM COMMITTEE
Susanne Albers, Universitat Freiburg, Germany
Mark de Berg, Technische Universiteit Eindhoven, the Netherlands
Kenneth Clarkson, IBM Research
Mike Fellows, University of Newcastle, Australia
Irene Finocchi (co-chair), Sapienza University of Rome, Italy
Efi Fogel, Tel Aviv University, Israel
Stefan Funke, Universitat Greifswald, Germany
John Hershberger (co-chair), Mentor Graphics Corporation, Calibre Division
Jyrki Katajainen, University of Copenhagen, Denmark
Piyush Kumar, Florida State University
Rina Panigrahy, Microsoft Research
CONTACT ADDRESSES
For further information please visit http://www.siam.org/meetings/alenex09/
This CfP was obtained from WikiCFP