SODA is sponsored by the SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory.
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.
The following meetings will be held jointly:
- ACM-SIAM Symposium on Discrete Algorithms
- SIAM Symposium on Algorithm Engineering and Experiments
- SIAM Symposium on Simplicity in Algorithms
- SIAM Symposium on Algorithmic Principles of Computer Systems
