Program
Jointly sponsored by
ACM Special Interest Group on Algorithms
and Computation Theory
and
SIAM Activity Group on Discrete Mathematics
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 | Experimental Algorithmics |
| Combinatorial Structures | Graph Drawing |
| Computational Physics | Graphs and Networks |
| Computational Biology | Machine Learning |
| Computational Finance | Mathematical Programming |
| Computational Geometry | Molecular Computing |
| Computational Topology | Number Theory and Algebra |
| Computer Graphics and Computer Vision | On-line Problems |
| Computer Systems | Pattern Matching and Data Compression |
| Cryptography and Security | Quantum Computing |
| Databases and Information Retrieval | Random Structures |
| Discrete Optimization | Robotics |
| Discrete Probability | Statistical Inference |
| Distributed Algorithms | Symbolic Computation |