ACM-SIAM Symposium on Discrete Algorithms (SODA09)
January 4-6, 2009
New York Marriott Downtown
New York, New York
The eleventh Workshop on Algorithm Engineering and Experiments (ALENEX09) and the sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO09) will be held immediately preceding the conference, on January 3, at the same location.
SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics.
Announcements
Student travel grants are now available. For more information, please see Student Information.
Congratulations to the following award winners!
Best Student Paper Award
Gabriel Nivasch
Improved Bounds and New Techniques for Davenport-Schinzel Sequences and Their Generalizations
Best Paper Award
Bernard Chazelle
Natural Algorithms
Program Committee
Claire Mathieu (Chair), Brown University
Nina Amenta, University of California, Davis
Petra Berenbrink, Simon Fraser University, Canada
Moses Charikar, Princeton University
Maria Chudnovsky, Columbia University
Kenneth Clarkson, IBM Research
Éric Colin de Verdière, École Normale Supérieure,
CNRS, France
Luc Devroye, McGill University, Canada
Amos Fiat, Tel Aviv University, Israel
Stefanie Gerke, Royal Holloway, University of London, United Kingdom
Sandy Irani, University of California, Irvine
Mihyun Kang, Humboldt University Berlin, Germany
Robert Kleinberg, Cornell University
Adam Klivans, University of Texas, Austin
John Langford, Yahoo Research
James Lee, University of Washington
Rajeev Motwani, Stanford University
Alantha Newman, Rutgers University
Yuval Rabani, Technion, Israel
Mauricio Resende, AT&T Research
Sebastien Roch, Microsoft Research
Liam Roditty, Weizmann Institute of Science, Israel
Gilles Schaeffer, École Polytechnique, CNRS, France
Adam Smith, Pennsylvania State University
Bettina Speckmann, Technische Universiteit Eindhoven, The Netherlands
Juan Vera, University of Waterloo, Canada
Lisa Yihao Zhang, Bell Laboratories
Description
This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.
Funding Agency
Funding agencies will be listed here when available.
Themes
Themes and application areas include, but are not limited to, the following topics:
Aspects of Combinatorics and Discrete Mathematics, such as:
- Algebra
- Combinatorial Structures
- Discrete Optimization
- Discrete Probability
- Graph Theory
- Mathematical Programming
- Number Theory
- Random Structures
- Topological Problems
Aspects of Computer Science, such as:
- Algorithm Analysis and Complexity
- Algorithmic Game Theory
- Algorithmic Mechanism Design
- Combinatorial Scientific Computing
- Communication Networks
- Computational Geometry
- Computer Graphics and Computer Vision
- Computer Systems
- Cryptography and Computer Security
- Data Compression
- Data Structures
- Databases and Information Retrieval
- Distributed and Parallel Computing
- Experimental Algorithmics
- Graph Algorithms
- Internet and Network Algorithms
- Machine Learning
- On-line Problems
- Quantum Computing
- Pattern Matching
- Robotics
- Scheduling and Resource Allocation Problems
- Symbolic Computation
Applications in the Sciences and Business such as:
- Bioinformatics
- Economics
- Manufacturing
- Finance
- Sociology
Important Deadlines
SUBMISSION DEADLINES
June 26, 2008 - Pre-Submission Deadline
July 3, 2008 - Final Submission Deadline
PRE-REGISTRATION DEADLINE
December 1, 2008
HOTEL RESERVATION DEADLINE
December 1, 2008
