General Information

The 55th ACM Symposium on Theory of Computing (STOC 2023) is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and is being held in Orlando, Florida Tuesday, June 20 - Friday, June 23, 2023.

STOC 2023 is part of the ACM Federated Computing Research Conference (FCRC)

Other conferences of interest to members of the STOC community will also take place at FCRC including SPAA and PODC.

Important Dates

STOC Short Abstract and Paper Registration Deadline: Friday, November 4, 2022 (4:59pm EDT). The STOC submission server is closed

STOC Paper Submission Deadline: Monday, November 7, 2022 (4:59pm EDT)

Submitted Papers Notification: February 6, 2023

Final STOC Papers Version Due: March 27, 2023. 14 page limit (including all references and appendices)

Early Registration Deadline: May 19, 2023. Registration is now open.

Conference Dates: June 20-23, 2023

STOC Paper Submission

Typical but not exclusive topics of interest include algorithms and data structures, computational complexity, randomness in computing, algorithmic graph theory and combinatorics, analysis of Boolean functions, approximation algorithms, cryptography, computational learning theory, continuous and discrete optimization, economics and computation, parallel and distributed algorithms, quantum computing, algorithmic coding theory, computational geometry, computational applications of logic, algebraic computation, and computational and foundational aspects of areas such as machine learning, fairness, privacy, networks, data management, databases and computational biology. Papers that extend the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.


General Chair: Barna Saha (University of California, San Diego)

Program Committee Chair: Rocco Servedio (Columbia University)

Theory Fest Organizers: Clement Cannone (University of Sydney), Elena Grigorescu (Purdue University), Raghu Meka (University of California Los Angeles), Barna Saha (chair) (University of California San Diego)

TCS for All Meeting Organizers: Debarati Das (Penn State), Sumegha Garg (Rutgers), Elena Grigorescu (Purdue), Barna Saha (UCSD), Virginia Vassilevska Williams (MIT)

SafeToC advocates: Mahdi Cheraghchi, Éva Tardos, and Yuval Rabani.

Program Committee:

  • Amir Abboud (Weizmann Institute of Science)
  • Josh Alman (Columbia University)
  • Andris Ambainis (University of Latvia)
  • Nima Anari (Stanford University)
  • Srinivasan Arunachalam (IBM Thomas J. Watson Research Center)
  • Petra Berenbrink (Universität Hamburg)
  • Aaron Bernstein (Rutgers University)
  • Aditya Bhaskara (University of Utah)
  • Sayan Bhattacharya (University of Warwick)
  • Eric Blais (University of Waterloo)
  • Hans Bodlaender (Utrecht University)
  • Adam Bouland (Stanford University)
  • Anne Broadbent (University of Ottawa)
  • Mark Bun (Boston University)
  • Keren Censor-Hillel (Technion)
  • Timothy Chan (University of Illinois at Urbana-Champaign)
  • Arkadev Chattopadhyay (Tata Institute of Fundamental Research)
  • Chandra Chekuri (University of Illinois at Urbana-Champaign)
  • Xue Chen (University of Science and Technology of China)
  • Gil Cohen (Tel Aviv University)
  • Dana Dachman-Soled (University of Maryland College Park)
  • Anindya De (University of Pennsylvania)
  • Shahar Dobzhinski (Weizmann Institute of Science)
  • Shaddin Dughmi (University of Southern California)
  • Vida Dujmovic (University of Ottawa)
  • Yuval Filmus (Technion)
  • Sumegha Garg (Stanford University)
  • Rong Ge (Duke University)
  • Elena Grigorescu (Purdue University)
  • Shuichi Hirahara (National Institute of Informatics, Japan)
  • Zhiyi Huang (University of Hong Kong)
  • Sungjin Im (University of California, Merced)
  • Giuseppe Italiano (LUISS University)
  • Ken-ichi Kawarabayashi (National Institute of Informatics, Japan)
  • Sanjeev Khanna (University of Pennsylvania)
  • Robin Kothari (Google Research)
  • Marvin Künnemann (TU Kaiserslautern)
  • Rasmus Kyng (ETH Zurich)
  • Sophie Laplante (Université Paris Cité)
  • Hung Le (University of Massachusetts, Amherst)
  • Daniel Lokshtanov (University of California, Santa Barbara)
  • Sepideh Mahabadi (Microsoft Research)
  • Nicole Megow (Universität Bremen)
  • Slobodan Mitrovic (University of California, Davis)
  • Ankur Moitra (Massachusetts Institute of Technology)
  • Shay Moran (Technion and Google Research)
  • Christopher Musco (New York University)
  • Krzysztof Onak (Boston University)
  • Rotem Oshman (Tel Aviv University)
  • Prasad Raghavendra (University of California, Berkeley)
  • Susanna Rezende (Lund University)
  • Robert Robere (McGill University)
  • Alon Rosen (Bocconi University and Reichman University)
  • Ron Rothblum (Technion)
  • Alex Russell (University of Connecticut)
  • Laura Sanità (Bocconi University)
  • Thatchaphol Saranurak (University of Michigan)
  • Tselil Schramm (Stanford University)
  • Rocco Servedio (Columbia University), Chair
  • Tasos Sidiropoulos (University of Illinois at Chicago)
  • Alex Slivkins (Microsoft Research)
  • Srikanth Srinivasan (Aarhus University)
  • David Steurer (ETH Zurich)
  • Ola Svensson (EPFL)
  • Chaitanya Swamy (University of Waterloo)
  • Madhur Tulsiani (Toyota Technological Institute at Chicago)
  • Christos Tzamos (University of Wisconsin-Madison)
  • Muthu Venkitasubramaniam (Georgetown University)
  • Ben Lee Volk (Reichman University)
  • Andreas Wiese (Technical University of Munich)
  • Mary Wootters (Stanford University)
  • Yuichi Yoshida (National Institute of Informatics, Japan)
  • Huacheng Yu (Princeton University)
  • Meirav Zehavi (Ben-Gurion University)


Apple logo