Symposium_on_Discrete_Algorithms

Symposium on Discrete Algorithms

Symposium on Discrete Algorithms

Add article description

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.[citation needed] SODA has been organized annually since 1990, typically in January.[1] 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.[2]

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.

More information Year, PC Chair ...


More information Year, Best Paper(s) ...

References

  1. [1]
    Symposium on Discrete Algorithms (SODA), DBLP, retrieved 2017-12-11
  2. [2]
    Winkler, Peter, How (and Why!) to Write a SODA Paper. Distributed by Howard Karloff with the call for papers for SODA 1998.


This article about a computer conference is a stub. You can help Wikipedia by expanding it.
Share this article:

This article uses material from the Wikipedia article Symposium_on_Discrete_Algorithms, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.