ACM STOC Conference

The Annual ACM Symposium on Theory of Computing (STOC), is the flagship conference of SIGACT, the Special Interest Group on Algorithms and Computation Theory, a special interest group of the Association for Computing Machinery (ACM). It has been held annually since 1969, traditionally in May/June.

STOC covers all areas of research within Algorithms and Computation Theory. Topics of interest include, but are not limited to: algorithms and data structures, computational complexity, randomness in computing, algorithmic graph theory and combinatorics, approximation algorithms, cryptography, computational learning theory, economics and computation, parallel and distributed algorithms, quantum computing, algorithmic coding theory, computational geometry, computational applications of logic, optimization, algebraic algorithms, and theoretical aspects of areas such as networks, privacy, computational biology, and databases. Papers that broaden the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.

Danny Lewin Best Student Paper Award

A prize is given to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). A paper is eligible if all of its authors are full-time students at the time of submission. This must be indicated in the submission registration process.

Business Meeting

The annual SIGACT business meeting is traditionally held during one evening of the STOC conference. Attendance is open to all members of the theoretical computer science community. SIGACT prizes, including the Knuth Prize, Gödel Prize, ACM-SIGACT Distinguished Service Prize, and the Danny Lewin Best Student Paper Award are traditionally awarded at the Business Meeting.

Upcoming Conferences

Previous Conference Websites

Conferences before the web


All STOC Proceedings are available in the ACM Digital Library.