Misplaced Pages

The Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) is an academic conference in the fields of algorithm design and discrete mathematics. It is considered to be one of the top conferences for research in algorithms. SODA has been organized annually since 1990, typically in January. SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) and the SIAM Activity Group on Discrete Mathematics, and in format is more similar to a theoretical computer science conference than to a mathematics conference.

History

The first Symposium on Discrete Algorithms was held in 1990 at San Francisco, organized by David Johnson. In 2012, the ACM Special Interest Group on Algorithms and Computation Theory (ACM SIGACT) and SIAM Activity Group on Discrete Mathematics (SIAG/DM) jointly established SODA Steering Committee to work with SIAM and ACM on organizing SODA.

References

1. For instance, SODA is the only conference with the top A* ranking in the 2023 CORE Rankings of algorithms conferences.
2. Symposium on Discrete Algorithms (SODA), DBLP, retrieved 2017-12-11
3. Winkler, Peter, How (and Why!) to Write a SODA Paper. Distributed by Howard Karloff with the call for papers for SODA 1998.

• v
• t
• e

• Theoretical computer science conferences
• Association for Computing Machinery conferences
• Computer conference stubs