--- title: "STOC (A*): papers and universities" description: "STOC (ACM Symposium on Theory of Computing) is rated A* by the CORE Conference Rankings (ICORE2026); OpenAlex lists 619 of its papers from 2024–2026 (190 in 2024, 219 in 2025, 210 in 2026). By the countries of the authors' institutions, the most papers come from the United States (430), Israel (84) and Switzerland (60)." url: https://scholar4ai.com/proceedings/stoc markdown_url: https://scholar4ai.com/proceedings/stoc.md license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/) share_text: "STOC (ACM Symposium on Theory of Computing) is rated A* by the CORE Conference Rankings (ICORE2026); OpenAlex lists 619 of its papers from 2024–2026 (190 in 2024, 219 in 2025, 210 in 2026). (as of 2026-11-02)" data_url: https://scholar4ai.com/data/rankings.json updated: 2026-11-02T12:20:52+09:00 window: 2026-10-04 to 2026-11-02 source: OpenAlex (CC0) --- # STOC: ACM Symposium on Theory of Computing — papers and institutions, 2024–2026 Papers of STOC, ACM Symposium on Theory of Computing (CORE rank A*; field: Theory of computation), 2024–2026: per year, the institutions, countries and topics, and the most-cited papers. Ranks are those of the CORE Conference Rankings, edition ICORE2026 (portal.core.edu.au), applied to every year shown. Papers are the works OpenAlex lists for the conference's proceedings, or for the issues of a conference-linked journal that publishes its papers (such as PACMPL, PVLDB or ACM TOG), by publication year; workshops, companion volumes, posters and Findings are left out. A paper counts once for each institution and country among its authors' affiliations as OpenAlex assigns them; papers without affiliations in OpenAlex count for none. For conferences published in book series that OpenAlex files as one source (LNCS, LIPIcs, SIAM and IOS Press proceedings), the papers are found by DOI: those of the volumes with the conference's title in Crossref, or LIPIcs DOIs, which name the conference. Conferences without DOIs (PMLR, USENIX, OpenReview) are listed without counts. A dash (–) for a year means OpenAlex has no papers of the conference for it yet: the proceedings are not published or indexed yet, or the conference did not meet that year (some meet every other year). 2026 counts what OpenAlex had indexed by 2026-11-02. All conferences: https://scholar4ai.com/proceedings.md ## Key findings - STOC (ACM Symposium on Theory of Computing) is rated A* by the CORE Conference Rankings (ICORE2026); OpenAlex lists 619 of its papers from 2024–2026 (190 in 2024, 219 in 2025, 210 in 2026). - By the countries of the authors' institutions, the most papers come from the United States (430), Israel (84) and Switzerland (60). - The institutions with the most papers are Massachusetts Institute of Technology (96), University of California, Berkeley (56) and Carnegie Mellon University (43). - Its most-cited paper of these years is “Calibrated Language Models Must Hallucinate” (2024), with 91 citations. ## Papers per year *STOC papers per publication year in OpenAlex (–: not in OpenAlex yet)* | Year | Papers | With affiliations | |---|---:|---:| | 2024 | 190 | 190 | | 2025 | 219 | 217 | | 2026 | 210 | 210 | ## Sources *Where OpenAlex lists the papers* | OpenAlex source | Which papers | |---|---| | [S7407087723](https://openalex.org/S7407087723) | The conference's proceedings | ## Who publishes there *Institutions with the most STOC papers, 2024–2026* | # | Institution | Papers | |---:|---|---:| | 1 | Massachusetts Institute of Technology | 96 | | 2 | University of California, Berkeley | 56 | | 3 | Carnegie Mellon University | 43 | | 4 | [Stanford University](https://scholar4ai.com/institutions/stanford-university.md) | 42 | | 5 | Columbia University | 41 | | 6 | ETH Zurich | 33 | | 7 | Princeton University | 28 | | 8 | University of Michigan | 26 | | 9 | Harvard University | 25 | | 10 | École Polytechnique Fédérale de Lausanne | 24 | *Countries with the most STOC papers, 2024–2026* | # | Country | Papers | |---:|---|---:| | 1 | United States | 430 | | 2 | Israel | 84 | | 3 | Switzerland | 60 | | 4 | United Kingdom | 58 | | 5 | Germany | 54 | | 6 | China | 50 | | 7 | Canada | 49 | | 8 | Denmark | 32 | | 9 | India | 25 | | 10 | France | 23 | *Keywords with the most STOC papers, 2024–2026* | # | Keyword | Papers | |---:|---|---:| | 1 | approximation algorithms | 55 | | 2 | lower bounds | 52 | | 3 | computational complexity | 39 | | 4 | communication complexity | 20 | | 5 | query complexity | 20 | | 6 | hardness of approximation | 19 | | 7 | sample complexity | 19 | | 8 | polynomial-time algorithms | 17 | | 9 | randomized algorithms | 17 | | 10 | circuit lower bounds | 15 | ## Most-cited papers *Most-cited STOC papers of 2024–2026 (citations counted by OpenAlex)* | # | Citations | Title | Published | Authors | |---:|---:|---|---|---| | 1 | 91 | [Calibrated Language Models Must Hallucinate](https://doi.org/10.1145/3618260.3649777) | 2024-06-10 | Adam Tauman Kalai, Santosh Vempala | | 2 | 26 | [Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation](https://doi.org/10.1145/3618260.3649671) | 2024-06-10 | Brent R. Waters, David J. Wu | | 3 | 25 | [Learning Shallow Quantum Circuits](https://doi.org/10.1145/3618260.3649722) | 2024-06-10 | Hsin-Yuan Huang, Yunchao Liu, Michael Broughton et al. | | 4 | 23 | [Commitments from Quantum One-Wayness](https://doi.org/10.1145/3618260.3649654) | 2024-06-10 | Dakshita Khurana, Kabir Tomer | | 5 | 21 | [Breaking the Sorting Barrier for Directed Single-Source Shortest Paths](https://doi.org/10.1145/3717823.3718179) | 2025-06-15 | Ran Duan, Jiayi Mao, Xiao Mao et al. | | 6 | 21 | [Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields](https://doi.org/10.1145/3618260.3649634) | 2024-06-10 | Omar Alrabiah, Venkatesan Guruswami, Ray Li | | 7 | 21 | [Constrained Submodular Maximization via New Bounds for DR-Submodular Functions](https://doi.org/10.1145/3618260.3649630) | 2024-06-10 | Niv Buchbinder, Moran Feldman | | 8 | 19 | [How to Construct Random Unitaries](https://doi.org/10.1145/3717823.3718254) | 2025-06-15 | Fermi Ma, Hsin-Yuan Huang | | 9 | 19 | [Quantum State Obfuscation from Classical Oracles](https://doi.org/10.1145/3618260.3649673) | 2024-06-10 | James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan | | 10 | 18 | [Improved Stabilizer Estimation via Bell Difference Sampling](https://doi.org/10.1145/3618260.3649738) | 2024-06-10 | Sabee Grewal, Vishnu Iyer, William Kretschmer et al. | ## Cite this page Scholar4AI. (2026). STOC: ACM Symposium on Theory of Computing — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/stoc ```bibtex @misc{scholar4ai-proceedings-stoc, author = {{Scholar4AI}}, title = {STOC: ACM Symposium on Theory of Computing — papers and institutions, 2024–2026}, year = {2026}, howpublished = {\url{https://scholar4ai.com/proceedings/stoc}}, urldate = {2026-11-02}, note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0} } ``` License: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/).