Symposium on Theory of Computing

STOC , the Annual ACM Symposium on Theory of Computing is an academic conference in the field of theoretical computer science . STOC has leg 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 or STOC, averaged from 1970 to 2012 is 31%, with the rate of 29% in 2012. [1]

If Fich (1996) writes, STOC and its annual IEEE counterpart FOCS (the Symposium on Foundations of Computer Science ) are Considered the two top conferences in theoretical computer science, [2]Considered Broadly, they ” are forums for some of the best work Throughout theory of computing dat promote breadth onder theory of computing researchers and help to keep the community together. ” Johnson (1984) of includes regular attendance at STOC and FOCS than one or verschillende Defining; characteristics or theoretical computer scientists.

Awards

The Gödel Prize for outstanding papers in theoretical computer science is Presented alternately at STOC and at the International Colloquium on Automata, Languages and Programming (ICALP); the Knuth Prize for outstanding contributions to theoretical computer science is Presented alternately at STOC and FOCS at.

Since 2003 STOC has Presented one or more Best Paper Awards [3] to herkennen the Highest quality papers at the conference. Additionally, the Danny Lewin Best Student Paper Award is Awarded to the authors of the best student-authored paper in STOC; [4] the award is named in honor of Daniel M. Lewin . [5] The FOCS counterpart of the best student paper award is the Machtey Award .

History

STOC was first organized on 5-7 May 1969 in Marina del Rey , California , United States . The conference chairman was Patrick C. Fischer , and the program committee consisted of Michael A. Harrison , Robert W. Floyd , Juris Hartmanis , Richard M. Karp , Albert R. Meyer , and Jeffrey D. Ullman . [6]

Early seminal papers in STOC include Cook (1971) , welke introduced the concept of NP-volledigheid (see also Cook Levin Theorem ).

STOC was organized in Canada in 1992, 1994, 2002 and 2008, and in Greece in 2001; all other meetings in 1969-2009 port leg hero in the United States . STOC was part of the Federated Computing Research Conference (FCRC) in 1993, 1996, 1999, 2003, 2007, and 2011.

Invited speakers

2004
Éva Tardos (2004), “Network games”, Network games , p. 341, doi : 10.1145 / 1007352.1007356
Avi Wigderson (2004), “Depth through breadth, or why arnt we attend talks in other areas?” Depth through breadth, or why arnt we attend talks in other areas? , P. 579, doi : 10.1145 / 1007352.1007359
2005
Lance Fortnow (2005), “Beyond NP: the work and legacy of Larry Stockmeyer” Beyond NP , p. 120, doi : 10.1145 / 1060590.1060609
2006
Prabhakar Raghavan (2006), “The changing face of Web search, algorithms, auctions and advertising,” The changing face of Web search , p. 129 doi : 10.1145 / 1132516.1132535
Russell Impagliazzo (2006), “Can everytime randomized algorithm be derandomized?” Can everytime randomized algorithm be derandomized? , P. 373, doi : 10.1145 / 1132516.1132571
2007
Nancy Lynch (2007), “Distributed computing theory: algorithms, impossibility results, models, and proofs,” Distributed computing theory , p. 247 doi : 10.1145 / 1250790.1250826
2008
Jennifer Rexford (2008), “Rethinking Internet routing” Rethinking Internet routing , p. 55, doi : 10.1145 / 1374376.1374386
David Häußler (2008), “Computing how we became human,” Computing how we became human , p. 639, doi : 10.1145 / 1374376.1374468
Ryan O’Donnell (2008), “Some topics in analysis of boolean functions,” Some topics in analysis of boolean functions , p. 569, doi : 10.1145 / 1374376.1374458
2009
Shafi Goldwasser (2009), “Athena lecture: Controlling Access to Programs?” Athena lecture , p. 167 doi : 10.1145 / 1536414.1536416

See also

  • Conferences in theoretical computer science.
  • The list of computer science conferences contains other academic conferences in computer science.

References

  • Cook, Stephen (1971), “The complexity of Stellingenbewijzen procedures”, Proc. STOC 1971 , pp. 151-158, doi : 10.1145 / 800157.805047 .
  • Fich, Faith (1996), “Infrastructure issues related to theory of computing research,” ACM Computing Surveys , 28 (4es): 217, doi : 10.1145 / 242224.242502 .
  • Johnson, DS (1984), “The genealogy of theoretical computer science: a Preliminary report”, ACM SIGACT News , 16 (2): 36-49, doi : 10.1145 / 1008959.1008960 .