Jump to content

Symposium on Discrete Algorithms

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 03:46, 11 December 2017 (→top: put full name first). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 and complexity. 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.[1]

References

  1. ^ 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.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Symposium_on_Discrete_Algorithms&oldid=814823220"