An additive combinatorics approach to the log-rank conjecture in communication complexity. - Eli Ben-Sasson; Shachar Lovett; Noga Zewi (Electron. Colloquium Comput. Complex., 2011)

Sampling-based proofs of almost-periodicity results and algorithmic applications. - Eli Ben-Sasson; Noga Ron-Zewi; Madhur Tulsiani; Julia Wolf (Electron. Colloquium Comput. Complex., 2012)

A new upper bound on the query complexity for testing generalized Reed-Muller codes. - Madhu Sudan 001; Noga Zewi (Electron. Colloquium Comput. Complex., 2012)

Vector representation of graph domination. - Noga Zewi (J. Graph Theory, 2012)

Absolutely Sound Testing of Lifted Codes. - Elad Haramaty; Noga Ron-Zewi; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2013)

An Additive Combinatorics Approach Relating Rank to Communication Complexity. - Eli Ben-Sasson; Shachar Lovett; Noga Ron-Zewi (J. ACM, 2014)

Additive combinatorics methods in computational complexity. - Noga Ron-Zewi (2014)

On Public Key Encryption from Noisy Codewords. - Eli Ben-Sasson; Iddo Bentov; Ivan Bjerre Damgård; Yuval Ishai; Noga Ron-Zewi (Electron. Colloquium Comput. Complex., 2015)

Towards Optimal Deterministic Coding for Interactive Communication. - Ran Gelles; Bernhard Haeupler; Gillat Kol; Noga Ron-Zewi; Avi Wigderson (Electron. Colloquium Comput. Complex., 2015)

High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. - Swastik Kopparty; Or Meir; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2015)

High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2015)

From Affine to Two-Source Extractors via Approximate Duality. - Eli Ben-Sasson; Noga Ron-Zewi (SIAM J. Comput., 2015)

Space Complexity in Polynomial Calculus. - Yuval Filmus; Massimo Lauria; Jakob Nordström; Noga Ron-Zewi; Neil Thapen (SIAM J. Comput., 2015)

Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. - Sivakanth Gopi; Swastik Kopparty; Rafael Mendes de Oliveira; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2016)

Sparse affine-invariant linear codes are locally testable. - Eli Ben-Sasson; Noga Ron-Zewi; Madhu Sudan 001 (Comput. Complex., 2017)

Local List Recovery of High-rate Tensor Codes & Applications. - Brett Hemenway; Noga Ron-Zewi; Mary Wootters (Electron. Colloquium Comput. Complex., 2017)

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. - Swastik Kopparty; Or Meir; Noga Ron-Zewi; Shubhangi Saraf (J. ACM, 2017)

From Local to Robust Testing via Agreement Testing. - Irit Dinur; Tali Kaufman; Noga Ron-Zewi (Electron. Colloquium Comput. Complex., 2018)

Improved decoding of Folded Reed-Solomon and Multiplicity Codes. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf; Mary Wootters (Electron. Colloquium Comput. Complex., 2018)

Erasures versus Errors in Local Decoding and Property Testing. - Sofya Raskhodnikova; Noga Ron-Zewi; Nithin Varma 001 (Electron. Colloquium Comput. Complex., 2018)

Explicit Capacity Approaching Coding for Interactive Communication. - Ran Gelles; Bernhard Haeupler; Gillat Kol; Noga Ron-Zewi; Avi Wigderson (IEEE Trans. Inf. Theory, 2018)

Erasures vs. Errors in Local Decoding and Property Testing. - Sofya Raskhodnikova; Noga Ron-Zewi; Nithin Varma 001 (ITCS, 2019)

On List Recovery of High-Rate Tensor Codes. - Swastik Kopparty; Nicolas Resch; Noga Ron-Zewi; Shubhangi Saraf; Shashwat Silas (Electron. Colloquium Comput. Complex., 2019)

LDPC Codes Achieve List-Decoding Capacity. - Jonathan Mosheiff; Nicolas Resch; Noga Ron-Zewi; Shashwat Silas; Mary Wootters (Electron. Colloquium Comput. Complex., 2019)

Local Proofs Approaching the Witness Length. - Noga Ron-Zewi; Ron Rothblum (Electron. Colloquium Comput. Complex., 2019)

Local Proofs Approaching the Witness Length [Extended Abstract]. - Noga Ron-Zewi; Ron D. Rothblum (FOCS, 2020)

Locally testable codes via high-dimensional expanders. - Yotam Dikstein; Irit Dinur; Prahladh Harsha; Noga Ron-Zewi (Electron. Colloquium Comput. Complex., 2020)

Efficient List-Decoding with Constant Alphabet and List Sizes. - Zeyu Guo 001; Noga Ron-Zewi (Electron. Colloquium Comput. Complex., 2020)

Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). - Noga Ron-Zewi; Ronen Shaltiel; Nithin Varma 001 (Electron. Colloquium Comput. Complex., 2020)

Linear-time Erasure List-decoding of Expander Codes. - Noga Ron-Zewi; Mary Wootters; Gilles Zémor (Electron. Colloquium Comput. Complex., 2020)

Local List Recovery of High-Rate Tensor Codes and Applications. - Brett Hemenway; Noga Ron-Zewi; Mary Wootters (SIAM J. Comput., 2020)

Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. - Noga Ron-Zewi; Ron Rothblum (Electron. Colloquium Comput. Complex., 2021)

Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. - Noga Ron-Zewi; Ivona Bezáková; László A. Végh (Adv. Math. Commun., 2021)

From Local to Robust Testing via Agreement Testing. - Irit Dinur; Prahladh Harsha; Tali Kaufman; Noga Ron-Zewi (Adv. Math. Commun., 2022)

Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020). - Arkadev Chattopadhyay; Marek Cygan; Noga Ron-Zewi; Christian Wulff-Nilsen (SIAM J. Comput., 2022)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2023)

Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. - Swastik Kopparty; Noga Ron-Zewi; Shubhangi Saraf; Mary Wootters (SIAM J. Comput., 2023)

Zero-knowledge IOPs Approaching Witness Length. - Noga Ron-Zewi; Mor Weiss (IACR Cryptol. ePrint Arch., 2024)

Low-Density Parity-Check Codes Achieve List-Decoding Capacity. - Jonathan Mosheiff; Nicolas Resch; Noga Ron-Zewi; Shashwat Silas; Mary Wootters (SIAM J. Comput., 2024)

Linear Prover IOPs in Log Star Rounds. - Noor Athamnah; Noga Ron-Zewi; Ron Rothblum (Electron. Colloquium Comput. Complex., 2025)

Finer-grained reductions in fine-grained hardness of approximation. - Elie Abboud; Noga Ron-Zewi (Theor. Comput. Sci., 2025)

Efficient Decoding of Double-circulant and Wozencraft Codes from Square-root Errors. - Oren Dubin; Noam Oz; Noga Ron-Zewi (CoRR, 2025)