The 54th ACM Symposium on Theory of Computing (STOC 2022) is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and will be held in Rome, Italy Monday June 20 – Friday, June 24, 2022.
Call For Workshops
The TheoryFest workshops will provide an informal forum for researchers to discuss important research questions, directions and challenges in the field, as well as a venue to invite new researchers to an area. They will begin with a tutorial, and will continue with research talks or other events highlighting recent results and new directions. We encourage workshops that focus on connections between theoretical computer science and other areas.
STOC paper submission deadline:
Thursday November 4, 2021, 4:59pm EDT.
Submitted Papers Notification: by February 6, 2022.
Workshops submission deadline: February 1, 2022.
Deadline for final versions of accepted papers: April 11, 2022.
Conference dates: June 20–24, 2022.
STOC Paper Submission
Typical but not exclusive topics of interest for STOC papers include foundational areas such as algorithms and data structures, computational complexity, parallel and distributed algorithms, quantum computing, continuous and discrete optimization, randomness in computing, approximation algorithms, combinatorics and algorithmic graph theory, cryptography, computational geometry, algebraic computation, computational applications of logic, and algorithmic coding theory. Typical topics also include computation and foundational aspects of areas such as machine learning, economics, fairness, privacy, networks, data management, and biology. Papers that broaden the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.
General Chair: Stefano Leonardi (Sapienza University of Rome)
Program Committee Chair: Anupam Gupta (Carnegie Mellon University)
Theory Fest Chair: Leonard Schulman (Caltech)
SafeToC advocates: Éva Tardos, Tom Gur, and Yuval Rabani.
- Sepehr Assadi (Rutgers University)
- Shalev Ben-David (University of Waterloo)
- Karl Bringmann (Saarland University)
- Shiri Chechik (Tel Aviv University)
- Andrew Childs (University of Maryland)
- Kai-Min Chung (Academia Sinica)
- Kenneth L. Clarkson (IBM Research)
- Alina Ene (Boston University)
- Michal Feldman (Tel Aviv University)
- Hu Fu (Shanghai University of Finance and Economics)
- Ankit Garg (Microsoft Research India)
- Mika Göös (EPFL)
- Anupam Gupta (Carnegie Mellon University) (chair)
- Venkatesan Guruswami (Carnegie Mellon University and UC Berkeley)
- Sam Hopkins (University of California Berkeley and MIT)
- Michael Kapralov (EPFL)
- Dakshita Khurana (University of Illinois)
- Gillat Kol (Princeton University)
- Mrinal Kumar (IIT Bombay)
- Amit Kumar (IIT Delhi)
- Rasmus Kyng (ETH Zurich)
- Kasper Green Larsen (Aarhus University)
- Euiwoong Lee (University of Michigan)
- Troy Lee (University of Technology, Sydney)
- François Le Gall (Nagoya University)
- Renato Paes Leme (Google Research)
- Jerry Li (Microsoft Research Redmond)
- Shi Li (The University at Buffalo)
- Huijia (Rachel) Lin (University of Washington)
- Konstantin Makarychev (Northwestern University)
- Pasin Manurangsi (Google Research)
- Shay Moran (Technion and Google Research)
- Dana Moshkovitz (University of Texas at Austin)
- Cameron Musco (University of Massachusetts Amherst)
- Danupon Nanongkai (University of Copenhagen)
- Michał Pilipczuk (University of Warsaw)
- Eva Rotenberg (DTU, Denmark)
- Thomas Rothvoss (University of Washington)
- Sushant Sachdeva (University of Toronto)
- Rocco Servedio (Columbia University)
- Luca Trevisan (Bocconi University)
- Greg Valiant (Stanford University)
- Santosh Vempala (Georgia Tech)
- Matt Weinberg (Princeton University)
- Ryan Williams (MIT)
- Ronald de Wolf (CWI and University of Amsterdam)