Scholar4AI Updated 2026-11-02 12:20 UTC+09:00

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. Also as Markdown.

Share: X LinkedIn Bluesky Threads Facebook Reddit Hacker News Hatena LINE Email
Copy:

← All conferences

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)
YearPapersWith affiliations
2024190190
2025219217
2026210210

Sources#

Where OpenAlex lists the papers
OpenAlex sourceWhich papers
S7407087723The conference's proceedings

Who publishes there#

Institutions with the most STOC papers, 2024–2026
#InstitutionPapers
1Massachusetts Institute of Technology96
2University of California, Berkeley56
3Carnegie Mellon University43
4Stanford University42
5Columbia University41
6ETH Zurich33
7Princeton University28
8University of Michigan26
9Harvard University25
10École Polytechnique Fédérale de Lausanne24
Countries with the most STOC papers, 2024–2026
#CountryPapers
1United States430
2Israel84
3Switzerland60
4United Kingdom58
5Germany54
6China50
7Canada49
8Denmark32
9India25
10France23
Keywords with the most STOC papers, 2024–2026
#KeywordPapers
1approximation algorithms55
2lower bounds52
3computational complexity39
4communication complexity20
5query complexity20
6hardness of approximation19
7sample complexity19
8polynomial-time algorithms17
9randomized algorithms17
10circuit lower bounds15

Most-cited papers#

Most-cited STOC papers of 2024–2026 (citations counted by OpenAlex)
#CitationsTitlePublishedAuthors
191Calibrated Language Models Must Hallucinate2024-06-10Adam Tauman Kalai, Santosh Vempala
226Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation2024-06-10Brent R. Waters, David J. Wu
325Learning Shallow Quantum Circuits2024-06-10Hsin-Yuan Huang, Yunchao Liu, Michael Broughton et al.
423Commitments from Quantum One-Wayness2024-06-10Dakshita Khurana, Kabir Tomer
521Breaking the Sorting Barrier for Directed Single-Source Shortest Paths2025-06-15Ran Duan, Jiayi Mao, Xiao Mao et al.
621Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields2024-06-10Omar Alrabiah, Venkatesan Guruswami, Ray Li
721Constrained Submodular Maximization via New Bounds for DR-Submodular Functions2024-06-10Niv Buchbinder, Moran Feldman
819How to Construct Random Unitaries2025-06-15Fermi Ma, Hsin-Yuan Huang
919Quantum State Obfuscation from Classical Oracles2024-06-10James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan
1018Improved Stabilizer Estimation via Bell Difference Sampling2024-06-10Sabee Grewal, Vishnu Iyer, William Kretschmer et al.

Conferences in the same field#

SODA · ICALP · EC · KR · FOCS · SoCG · CAV · LICS · ESA · ITCS · APPROX/RANDOM · STACS · IJCAR · CCC · GD · SAT · ALENEX

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

@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}
}

Free to reuse for non-commercial purposes with attribution (CC BY-NC 4.0).