Symposium on Discrete Algorithms
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.[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 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) was held in 1990 at San Francisco, organized by David Johnson.
| Year | PC Chair | Location |
|---|---|---|
| 1990 | David S. Johnson | San Francisco |
| 1991 | Alok Aggarwal | San Francisco |
| 1992 | Greg N. Frederickson | Orlando |
| 1993 | Vijaya Ramachandran | Austin |
| 1994 | Daniel Dominic Sleator | Arlington |
| 1995 | Kenneth L. Clarkson | San Francisco |
| 1996 | Éva Tardos | Atlanta |
| 1997 | Michael E. Saks | New Orleans |
| 1998 | Howard J. Karloff | San Francisco |
| 1999 | Robert Endre Tarjan | Baltimore |
| 2000 | David B. Shmoys | San Francisco |
| 2001 | S. Rao Kosaraju | Washington, DC, |
| 2002 | David Eppstein | San Francisco |
| 2003 | Martin Farach-Colton | Baltimore |
| 2004 | J. Ian Munro | New Orleans |
| 2005 | Adam Buchsbaum | British Columbia |
| 2006 | Cliff Stein | Miami |
| 2007 | Harold Gabow | New Orleans |
| 2008 | Shang-Hua Teng | San Francisco |
| 2009 | Claire Mathieu | New York |
| 2010 | Moses Charikar | Austin |
| 2011 | Dana Randall | San Francisco |
| 2012 | Yuval Rabani | Kyoto |
| 2013 | Sanjeev Khanna | New Orleans |
| 2014 | Chandra Chekuri | Portland |
| 2015 | Piotr Indyk | San Diego |
| 2016 | Robert Krauthgamer | Arlington |
| 2017 | Philip N. Klein | Barcelona |
| 2018 | Artur Czumaj | New Orleans |
| 2019 | Timothy M. Chan | San Diego |
| 2020 | Shuchi Chawla | Salt Lake City |
gollark: Don't Apple preinstall Facebook?
gollark: I don't think you understand how Android works.
gollark: It doesn't do that for me. Maybe your phone is bad.
gollark: Closed-source-ness IS NOT REQUIRED FOR THAT.
gollark: > and because their stuff is closed-source, they can easily optimize software for all devicesWhat?
References
- Symposium on Discrete Algorithms (SODA), DBLP, retrieved 2017-12-11
- Winkler, Peter, How (and Why!) to Write a SODA Paper. Distributed by Howard Karloff with the call for papers for SODA 1998.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.