Symposium on Discrete Algorithms

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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]

References

  1. ^ Symposium on Discrete Algorithms (SODA), DBLP, retrieved 2017-12-11
  2. ^ Winkler, Peter, How (and Why!) to Write a SODA Paper. Distributed by Howard Karloff with the call for papers for SODA 1998.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Symposium_on_Discrete_Algorithms&oldid=863767472"
This content was retrieved from Wikipedia : http://en.wikipedia.org/wiki/Symposium_on_Discrete_Algorithms
This page is based on the copyrighted Wikipedia article "Symposium on Discrete Algorithms"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA