ACM STOC conference

ACM STOC conference
Name	ACM STOC
Discipline	Theoretical computer science
Abbreviation	STOC
Publisher	Association for Computing Machinery
Country	International
Frequency	Annual

ACM STOC conference is a premier annual symposium in theoretical computer science that brings together researchers from Massachusetts Institute of Technology, Stanford University, University of California, Berkeley, Harvard University, Princeton University and institutions worldwide to present advances in algorithms, complexity, cryptography, and related areas. The symposium has shaped developments in P versus NP problem, NP-completeness, cryptography, randomized algorithms and foundational models such as the Turing machine and the Boolean circuit. Participants often include authors whose work connects to milestones like the Cook–Levin theorem, the RSA (cryptosystem), and the Kadane's algorithm lineage through algorithmic theory.

History

STOC traces roots to early gatherings in theoretical computer science that intersected with conferences at Bell Labs, IBM Research, University of Illinois Urbana–Champaign, Carnegie Mellon University, and Cornell University. Early program committees featured figures linked to the Hopcroft–Ullman era, the Knuth lineage, and researchers associated with the National Science Foundation funding for theoretical research. Over decades the symposium overlapped chronologically and thematically with events such as the FOCS, ICALP, and regional workshops hosted by European Research Consortium for Informatics and Mathematics collaborators. Landmark years saw presentations that echoed through follow-on work at institutions including Microsoft Research, Google Research, Bellcore, and national labs like Los Alamos National Laboratory.

Scope and Topics

The symposium’s scope spans classical and emerging topics, connecting results in computational complexity theory, approximation algorithms, graph theory (mathematics), machine learning at Stanford, quantum computing developments tied to Shor's algorithm, and intersections with cryptographic protocols near Diffie–Hellman key exchange. Papers often reference methods from researchers with appointments at ETH Zurich, École Polytechnique Fédérale de Lausanne, University of Cambridge, University of Oxford, Tel Aviv University, and Weizmann Institute of Science. The program regularly includes sessions on streaming algorithms influenced by work at Yahoo! Research, distributed computation related to Lamport's models, and foundational lower bounds connected to the Circuit complexity literature.

Organization and Sponsorship

STOC is organized under the aegis of the Association for Computing Machinery with program committees drawn from faculty at Columbia University, Yale University, University of Toronto, McGill University, and research labs such as Amazon Science and IBM Research. Sponsorship often comes from corporate partners including Google, Microsoft, Meta Platforms, and national agencies like the European Research Council and the National Science Foundation. Local organizing committees have been hosted by venues including New York University, University of Washington, University of Illinois, and international hosts such as University of Sydney and University of Toronto.

Conference Structure and Program

Typical programs include plenary invited talks, contributed paper sessions, poster sessions, and tutorials; invited speakers have included luminaries affiliated with Institute for Advanced Study, Princeton University, California Institute of Technology, Rutgers University, and Brown University. Workshops and satellite events often coincide with collaborations involving SIAM chapters, IEEE societies, and SIGs within ACM Research. Sessions highlight topics ranging from derandomization rooted in the work of Nisan and Zuckerman to hardness results that build on the Cook–Levin theorem lineage. Tutorials have been taught by researchers from Stanford Linear Accelerator Center-affiliated groups and quantum sessions have featured presenters connected to IBM Quantum and Google Quantum AI.

Notable Papers and Impact

Papers first presented at the symposium have catalyzed advances related to the P versus NP problem, hardness of approximation inspired by the PCP theorem, foundational cryptographic constructions akin to RSA (cryptosystem), and algorithms that influenced industry practices at Google and Amazon. Results concerning sublinear algorithms, streaming lower bounds, and property testing often cite precursor work from labs at Bell Labs, IBM Research, and university groups at Cornell and MIT. Breakthroughs later expanded into textbooks published by academic presses affiliated with authors at Oxford University Press and Cambridge University Press.

Awards

STOC recognizes outstanding work through best paper awards and invited lecture prizes often correlated with honors such as the Gödel Prize, the Knuth Prize, and fellowships from the Association for Computing Machinery. Recipients have included researchers affiliated with Harvard University, Princeton University, ETH Zurich, University of California, Berkeley, and industrial researchers from Microsoft Research and Google Research. Awards spotlight contributions that later inform prizes like the Turing Award recognition for foundational contributions to algorithms and complexity.

Participation and Submission Process

Participation is international, with attendees from universities including University of Tokyo, National University of Singapore, Peking University, Tsinghua University, Seoul National University, and research centers such as Max Planck Society institutes. Submissions follow a peer-review process administered by program committees and area chairs drawn from ACM Special Interest Group on Algorithms and Computation Theory, with policies comparable to those of IEEE Symposium on Foundations of Computer Science and International Colloquium on Automata, Languages and Programming. Accepted papers proceed to presentation and archival publication in the ACM proceedings, and authors often follow up with extended journal versions submitted to venues like Journal of the ACM and SIAM Journal on Computing.

Category:Theoretical computer science conferences