| 2026 | MFCS | Highly-Efficient Local Proofs and Codes (Invited Talk). | Noga Ron-Zewi |
| 2025 | TCC | Linear Prover IOPs in Log Star Rounds. | Noor Athamnah, Noga Ron-Zewi, Ron D. Rothblum |
| 2024 | CRYPTO | Zero-Knowledge IOPs Approaching Witness Length. | Noga Ron-Zewi, Mor Weiss |
| 2024 | ICALP | Finer-Grained Reductions in Fine-Grained Hardness of Approximation. | Elie Abboud, Noga Ron-Zewi |
| 2022 | STOC | Proving as fast as computing: succinct arguments with constant prover overhead. | Noga Ron-Zewi, Ron D. Rothblum |
| 2021 | STOC | Efficient list-decoding with constant alphabet and list sizes. | Zeyu Guo, Noga Ron-Zewi |
| 2020 | FOCS | LDPC Codes Achieve List Decoding Capacity. | Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters |
| 2020 | FOCS | Local Proofs Approaching the Witness Length [Extended Abstract]. | Noga Ron-Zewi, Ron D. Rothblum |
| 2020 | ISIT | Linear-time Erasure List-decoding of Expander Codes. | Noga Ron-Zewi, Mary Wootters, Gilles Zmor |
| 2018 | FOCS | Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. | Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters |
| 2017 | FOCS | Local List Recovery of High-Rate Tensor Codes & Applications. | Brett Hemenway, Noga Ron-Zewi, Mary Wootters |
| 2017 | SODA | Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. | Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf |
| 2016 | PKC | On Public Key Encryption from Noisy Codewords. | Eli Ben-Sasson, Iddo Bentov, Ivan Damgrd, Yuval Ishai, Noga Ron-Zewi |
| 2016 | SODA | Towards Optimal Deterministic Coding for Interactive Communication. | Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson |
| 2016 | STOC | High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. | Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf |
| 2014 | ICALP | Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications. | Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf |
| 2012 | FOCS | An Additive Combinatorics Approach Relating Rank to Communication Complexity. | Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi |
| 2012 | FOCS | Sparse Affine-Invariant Linear Codes Are Locally Testable. | Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan |