|
|
Eleventh Annual ACM-SIAM Symposium
on Discrete Algorithms
January 9-11, 2000
Holiday Inn Golden
Gateway Hotel
San Francisco, California
 
Sponsored by ACM Special
Interest Group on Algorithms and Computation
Theory
and SIAM Activity Group on Discrete Mathematics
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 datasets, 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 Finance
Computational Geometry
Computer Graphics and Computer Vision
Cryptography and Security
Databases and Information Retrieval
Discrete Optimization
Distributed Algorithms
Experimental Algorithmics
|
Graph Drawing
Graphs and Networks
Machine Learning
Models of Computation
Number Theory and Algebra
On-line Problems
Pattern Matching and Data Compression
Random Structures
Robotics
Statistical Inference
Symbolic Computation
|
Get-Togethers
|
Welcoming and Dessert Reception
8:00 PM-10:00 PM
Saturday, January 8
Redwood Room
Continental Breakfast
8:00 AM-8:50 AM
Sunday, January 9 - Tuesday, January 11
Convention Foyer
|
Luncheon
12:00 PM-1:30 PM
Sunday, January 9
Emerald Room
SODA Business Meeting
6:15 PM-7:15 PM
Monday, January 10
Washington/California Room
|
|
A printable version of the 