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

CCC: IEEE Conference on Computational Complexity — papers and institutions, 2024–2026

Papers of CCC, IEEE Conference on Computational Complexity (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#

  • CCC (IEEE Conference on Computational Complexity) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 96 of its papers from 2024–2026 (28 in 2024, 30 in 2025, 38 in 2026).
  • By the countries of the authors' institutions, the most papers come from the United States (59), Israel (20) and Canada (13).
  • The institutions with the most papers are Tel Aviv University (9), University of California San Diego (8) and Massachusetts Institute of Technology (8).
  • Its most-cited paper of these years is “The Computational Advantage of MIP* Vanishes in the Presence of Noise” (2025), with 4 citations.

Papers per year#

CCC papers per publication year in OpenAlex (–: not in OpenAlex yet)
YearPapersWith affiliations
20242828
20253030
20263838

Sources#

Where OpenAlex lists the papers
OpenAlex sourceWhich papers
S4377196569LIPIcs papers with the DOIs 10.4230/LIPIcs.CCC.<year>.<n>

Who publishes there#

Institutions with the most CCC papers, 2024–2026
#InstitutionPapers
1Tel Aviv University9
2University of California San Diego8
3Massachusetts Institute of Technology8
4University of California, Berkeley8
5École Polytechnique Fédérale de Lausanne7
6University of Copenhagen6
7Institute for Advanced Study6
8Tata Institute of Fundamental Research5
9University of Waterloo5
10University of Toronto5
Countries with the most CCC papers, 2024–2026
#CountryPapers
1United States59
2Israel20
3Canada13
4United Kingdom11
5Switzerland9
6India9
7Germany6
8Denmark6
9China4
10Czechia4
Keywords with the most CCC papers, 2024–2026
#KeywordPapers
1lower bounds10
2circuit lower bounds8
3derandomization8
4proof complexity7
5communication complexity6
6Boolean circuit complexity5
7Boolean functions5
8error-correcting codes5
9pseudorandom generators5
10pseudorandomness5

Most-cited papers#

Most-cited CCC papers of 2024–2026 (citations counted by OpenAlex)
#CitationsTitlePublishedAuthors
14The Computational Advantage of MIP* Vanishes in the Presence of Noise2025-08-16Yangjing Dong, Honghao Fu, Anand Natarajan et al.
23Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy2024-01-01Sepehr Assadi, Prantar Ghosh, Bruno Loff et al.
33Exponential Separation Between Powers of Regular and General Resolution Over Parities2024-01-01Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvořák
42Baby PIH: Parameterized Inapproximability of Min CSP2024-01-01Venkatesan Guruswami, Xuandi Ren, Vidiyala Sai Sandeep
52Linear-Size Boolean Circuits for Multiselection2024-01-01Justin Holmgren, Ron D. Rothblum
62Derandomizing Logspace With a Small Shared Hard Drive2025-09-22Edward Pyne
71A Technique for Hardness Amplification Against AC⁰2024-01-01William M. Hoza
81Hard submatrices for non-negative rank and communication complexity2025-08-13Pavel Hrubeš
91Explicit Time and Space Efficient Encoders Exist Only with Random Access2024-01-01J. D. Cook, Dana Moshkovitz
101Generalised Linial-Nisan Conjecture Is False for DNFs2025-01-01Alekseev, Yaroslav, Mika Göös, Guan, Ziyi et al.

Conferences in the same field#

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

Cite this page

Scholar4AI. (2026). CCC: IEEE Conference on Computational Complexity — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/ccc

@misc{scholar4ai-proceedings-ccc,
  author = {{Scholar4AI}},
  title = {CCC: IEEE Conference on Computational Complexity — papers and institutions, 2024–2026},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/proceedings/ccc}},
  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).