Symposium on Theory of Computing
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.[1]
As
Awards
The
Since 2003, STOC has presented one or more Best Paper Awards
History
STOC was first organised on 5–7 May 1969, in
Early seminal papers in STOC include Cook (1971), which introduced the concept of NP-completeness (see also Cook–Levin theorem).
Location
STOC was organised in Canada in 1992, 1994, 2002, 2008, and 2017 in Greece in 2001, as a virtual/online conference in 2020 and 2021, and in Italy in 2022; all other meetings in 1969–2023 have been held in the United States. STOC was part of the Federated Computing Research Conference (FCRC) in 1993, 1996, 1999, 2003, 2007, 2011, 2015, 2019, and 2023.
Invited speakers
- 2009
- ISBN 9781605585062
- 2010
- David S. Johnson (2010), "Approximation Algorithms in Theory and Practice" (Knuth Prize Lecture)
- 2011
- Leslie G. Valiant(2011), "The Extent and Limitations of Mechanistic Explanations of Nature" (2010 ACM Turing Award Lecture)
- Ravi Kannan(2011), "Algorithms: Recent Highlights and Challenges" (2011 Knuth Prize Lecture)
- David A. Ferruci (2011), "IBM's Watson/DeepQA" (FCRC Plenary Talk)
- Luiz Andre Barroso (2011), "Warehouse-Scale Computing: Entering the Teenage Decade" (FCRC Plenary Talk)
- 2013
- Gary Miller (2013), Knuth Prize Lecture
- Prabhakar Raghavan (2013), Plenary talk
- 2014
- Thomas Rothvoss (2014), "The matching polytope has exponential extension complexity"
- Shafi Goldwasser (2014), "The Cryptographic Lens" (Turing Award Lecture) video
- Silvio Micali (2014), "Proofs according to Silvio" (Turing Award Lecture) video
- 2015
- Michael Stonebraker (2015), Turing Award Lecture video
- Andrew Yao (2015), FCRC Keynote Lecture
- László Babai (2015), Knuth Prize Lecture
- Olivier Temam (2015), FCRC Keynote Lecture
- 2016
- Santosh Vempala (2016), "The Interplay of Sampling and Optimization in High Dimension" (Invited Talk)
- Timothy Chan(2016), "Computational Geometry, from Low to High Dimensions" (Invited Talk)
- 2017
- Avi Wigderson (2017), "On the Nature and Future of ToC" (Keynote Talk)
- Orna Kupferman (2017), "Examining classical graph-theory problems from the viewpoint of formal-verification methods" (Keynote Talk)
- Oded Goldreich (2017), Knuth Prize Lecture
See also
- Conferences in theoretical computer science.
- List of computer science conferences contains other academic conferences in computer science.
- List of computer science awards
Notes
- ^ "Proceedings of the 44th symposium on Theory of Computing". 2012. Retrieved 2012-09-17.
- ^ "Conference Ranks". Retrieved 2016-08-30.
- ^ "STOC Conference Best Paper Awards". Retrieved 2012-04-07.
- ^ "Danny Lewin Best Student Paper Award". Archived from the original on 2008-06-20.
- ^ Leighton, Tom (2002). "Remarks made by Tom Leighton to commemorate the naming of the STOC Best Student Paper Award in honor of the late Daniel Lewin".
- doi:10.1145/800169.
References
External links
- Official website
- STOC proceedings information in DBLP.
- STOC proceedings in the ACM Digital Library.
- Citation Statistics for FOCS/STOC/SODA, Piotr Indyk and Suresh Venkatasubramanian, July 2007.