ALENEX 02 Call for Papers

[Dave MOUNT]

                         CALL FOR PAPERS

        4th Workshop on Algorithm Engineering and Experiments
                            ALENEX 02

             January 4-5, 2002, San Francisco, California
                       Radisson Miyako Hotel

GENERAL INFORMATION:

The aim of the annual ALENEX workshops is to provide a forum for the
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 invited talks, contributed research
papers, and ample time for discussion and debate of topics in this
rapidly evolving research area.  A proceedings will be published, and a
special issue of the ACM Journal of Experimental Algorithmics will
feature invited contributions from the workshop.

This workshop is colocated with the 12th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA02), and will take place in the two days
preceding that conference.  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 overlapping papers.

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.

SUBMISSIONS:

Authors are invited to submit 10-page extended abstracts by 5:00 PM EDT,
OCTOBER 8, 2001 and must use the SIGACT electronic submissions server.
Detailed instructions for submitting to the workshop can be found at the
workshop's website.

    http://cs.umd.edu/~mount/ALENEX02

Notification of acceptance or rejection will be sent by November 5,
2001.  The deadline for receipt of papers in final version is December
10, 2001.  Presenters must have submitted the final versions of their
papers in order to be able to present them at the workshop.

PROGRAM COMMITTEE:

Nancy Amato, Texas A&M University
Marshall Bern,Xerox PARC
Michael Goodrich, Johns Hopkins University
Tom McCormick, University of British Columbia
Michael Mitzenmacher, Harvard University
David Mount, (Co-chair), University of Maryland
Giri Narasimhan, University of Memphis
Rajeev Raman, University of Leicester
Clifford Stein, (Co-chair), Columbia University


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.