---
title: "CCC (A): papers and universities"
description: "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)."
url: https://scholar4ai.com/proceedings/ccc
markdown_url: https://scholar4ai.com/proceedings/ccc.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "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). (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)
---

# 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.

All conferences: https://scholar4ai.com/proceedings.md

## 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)*

| Year | Papers | With affiliations |
|---|---:|---:|
| 2024 | 28 | 28 |
| 2025 | 30 | 30 |
| 2026 | 38 | 38 |

## Sources

*Where OpenAlex lists the papers*

| OpenAlex source | Which papers |
|---|---|
| [S4377196569](https://openalex.org/S4377196569) | LIPIcs papers with the DOIs 10.4230/LIPIcs.CCC.<year>.<n> |

## Who publishes there

*Institutions with the most CCC papers, 2024–2026*

| # | Institution | Papers |
|---:|---|---:|
| 1 | [Tel Aviv University](https://scholar4ai.com/institutions/tel-aviv-university.md) | 9 |
| 2 | University of California San Diego | 8 |
| 3 | Massachusetts Institute of Technology | 8 |
| 4 | University of California, Berkeley | 8 |
| 5 | École Polytechnique Fédérale de Lausanne | 7 |
| 6 | University of Copenhagen | 6 |
| 7 | Institute for Advanced Study | 6 |
| 8 | Tata Institute of Fundamental Research | 5 |
| 9 | University of Waterloo | 5 |
| 10 | [University of Toronto](https://scholar4ai.com/institutions/university-of-toronto.md) | 5 |

*Countries with the most CCC papers, 2024–2026*

| # | Country | Papers |
|---:|---|---:|
| 1 | United States | 59 |
| 2 | Israel | 20 |
| 3 | Canada | 13 |
| 4 | United Kingdom | 11 |
| 5 | Switzerland | 9 |
| 6 | India | 9 |
| 7 | Germany | 6 |
| 8 | Denmark | 6 |
| 9 | China | 4 |
| 10 | Czechia | 4 |

*Keywords with the most CCC papers, 2024–2026*

| # | Keyword | Papers |
|---:|---|---:|
| 1 | lower bounds | 10 |
| 2 | circuit lower bounds | 8 |
| 3 | derandomization | 8 |
| 4 | proof complexity | 7 |
| 5 | communication complexity | 6 |
| 6 | Boolean circuit complexity | 5 |
| 7 | Boolean functions | 5 |
| 8 | error-correcting codes | 5 |
| 9 | pseudorandom generators | 5 |
| 10 | pseudorandomness | 5 |

## Most-cited papers

*Most-cited CCC papers of 2024–2026 (citations counted by OpenAlex)*

| # | Citations | Title | Published | Authors |
|---:|---:|---|---|---|
| 1 | 4 | [The Computational Advantage of MIP* Vanishes in the Presence of Noise](https://doi.org/10.1145/3760771) | 2025-08-16 | Yangjing Dong, Honghao Fu, Anand Natarajan et al. |
| 2 | 3 | [Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy](https://doi.org/10.4230/lipics.ccc.2024.7) | 2024-01-01 | Sepehr Assadi, Prantar Ghosh, Bruno Loff et al. |
| 3 | 3 | [Exponential Separation Between Powers of Regular and General Resolution Over Parities](https://doi.org/10.4230/lipics.ccc.2024.23) | 2024-01-01 | Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvořák |
| 4 | 2 | [Baby PIH: Parameterized Inapproximability of Min CSP](https://doi.org/10.4230/lipics.ccc.2024.27) | 2024-01-01 | Venkatesan Guruswami, Xuandi Ren, Vidiyala Sai Sandeep |
| 5 | 2 | [Linear-Size Boolean Circuits for Multiselection](https://doi.org/10.4230/lipics.ccc.2024.11) | 2024-01-01 | Justin Holmgren, Ron D. Rothblum |
| 6 | 2 | [Derandomizing Logspace With a Small Shared Hard Drive](https://doi.org/10.1007/s00037-025-00275-6) | 2025-09-22 | Edward Pyne |
| 7 | 1 | [A Technique for Hardness Amplification Against AC⁰](https://doi.org/10.4230/lipics.ccc.2024.1) | 2024-01-01 | William M. Hoza |
| 8 | 1 | [Hard submatrices for non-negative rank and communication complexity](https://doi.org/10.1007/s00037-025-00269-4) | 2025-08-13 | Pavel Hrubeš |
| 9 | 1 | [Explicit Time and Space Efficient Encoders Exist Only with Random Access](https://doi.org/10.4230/lipics.ccc.2024.5) | 2024-01-01 | J. D. Cook, Dana Moshkovitz |
| 10 | 1 | [Generalised Linial-Nisan Conjecture Is False for DNFs](https://doi.org/10.4230/lipics.ccc.2025.29) | 2025-01-01 | Alekseev, Yaroslav, Mika Göös, Guan, Ziyi et al. |

## 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

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

License: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/).