SIAM Annual ACM-SIAM Symposium on Discrete Algorithms

SIAM Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, Radisson Miyako Hotel, San Francisco, CA

Jointly sponsored by ACM Special Interest Group on Algorithms and Computation Theory
and SIAM Activity Group on Discrete Mathematics

Immediately preceding the conference at the same location...
The 4th Workshop on Algorithm Engineering and Experiments (ALENEX 02)
January 4-5, 2002

About the Symposium

This symposium concerns research on the use, design, and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms. Performance analysis may be analytical or experimental, and may address worst-case or average-case performance. These studies can be theoretical or based on real data sets, and may address methodological issues involved in performance analysis.

Application areas include, but are not limited to:

Discrete Mathematics and Combinatorics
Combinatorial Structures
Communication Networks
Computational Biology
Computational Physics
Computational Finance
Computational Geometry
Computational Topology
Computer Graphics and Computer Vision
Computer Systems
Cryptography and Security
Databases and Information Retrieval
Discrete Optimization
Discrete Probability
Distributed Algorithms
Experimental Algorithmics
Graph Drawing
Graphs and Networks
Machine Learning
Mathematical Programming
Molecular Computing
Number Theory and Algebra
On-line Problems
Pattern Matching and Data Compression
Quantum Computing
Random Structures
Robotics
Statistical Inference
Symbolic Computation

Program Committee

David Eppstein, University of California, Irvine, (Chair)
Erik Demaine, University of Waterloo, Canada
Benjamin Doerr, Christian-Alberts-University Kiel, Germany
Lisa K Fleischer, Carnegie Mellon University
Ashish Goel, University of Southern California
Mike Goodrich, Johns Hopkins University
Sanjeev Khanna, University of Pennsylvania
Valerie King, University of Victoria
Ian Munro, University of Waterloo, Canada
Dana Randall, Georgia Institute of Technology
Bruce Shepherd, Bell Laboratories, Lucent Technologies
Dan Spielman, Massachusetts Institute of Technology
Benjamin Sudakov, Princeton University
Subhash Suri, University of California, Santa Barbara
Tandy Warnow, University of Texas

Invited Speakers

Sunday, January 6, 2002
11:30 AM - 12:30 PM Plenary Session
Session 2: IP1 The Theory Behind LEDA
Kurt Mehlhorn, Max-Planck-Institut für Informatik, Germany

Monday, January 7, 2002
11:30 AM - 12:30 PM Plenary Session
Session 6:IP2 The Virtues of Expanding Geometric Objects
Bob Connelly, Cornell University

About San Francisco

For more information, visit the San Francisco Convention & Visitors Bureau.

About ALENEX

The 4th Workshop on Algorithm Engineering and Experiments (ALENEX 02), will be held in San Francisco, California, on January 4-5, 2002 at the Radisson Miyako Hotel. It is co-located with the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA02), which will take place the following three days, January 6-8, 2002. For more information about ALENEX02 visit http://www.cs.umd.edu/~mount/ALENEX02/.

Exhibits

Publishers, software and hardware suppliers, service organizations and others having products or services to offer, are invited to participate in the exhibition. For further information and fees, please contact the SIAM Marketing Representative, at [email protected].