Noga Ron-Zewi

According to our database, Noga Ron-Zewi authored at least 42 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Efficient Decoding of Double-circulant and Wozencraft Codes from Square-root Errors.

Oren Dubin, Noam Oz, Noga Ron-Zewi

CoRR, July, 2025

Linear Prover IOPs in Log Star Rounds.

Noor Athamnah, Noga Ron-Zewi, Ron Rothblum

Electron. Colloquium Comput. Complex., 2025

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

Finer-Grained Reductions in Fine-Grained Hardness of Approximation.

Elie Abboud, Noga Ron-Zewi

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Zero-Knowledge IOPs Approaching Witness Length.

Noga Ron-Zewi, Mor Weiss

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes.

Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters

SIAM J. Comput., June, 2023

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes.

Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf

Electron. Colloquium Comput. Complex., 2023

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., June, 2022

Proving as fast as computing: succinct arguments with constant prover overhead.

Noga Ron-Zewi, Ron D. Rothblum

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword.

Noga Ron-Zewi, Ivona Bezáková, László A. Végh

Theory Comput., 2021

Efficient list-decoding with constant alphabet and list sizes.

Zeyu Guo, Noga Ron-Zewi

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

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

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

Local List Recovery of High-Rate Tensor Codes and Applications.

Brett Hemenway, Noga Ron-Zewi, Mary Wootters

SIAM J. Comput., 2020

Locally testable codes via high-dimensional expanders.

Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi

Electron. Colloquium Comput. Complex., 2020

Linear-time Erasure List-decoding of Expander Codes.

Noga Ron-Zewi, Mary Wootters, Gilles Zémor

Proceedings of the IEEE International Symposium on Information Theory, 2020

Local Proofs Approaching the Witness Length [Extended Abstract].

Noga Ron-Zewi, Ron D. Rothblum

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

LDPC Codes Achieve List Decoding Capacity.

Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Local Proofs Approaching the Witness Length.

Noga Ron-Zewi, Ron Rothblum

Electron. Colloquium Comput. Complex., 2019

Erasures vs. Errors in Local Decoding and Property Testing.

Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

From Local to Robust Testing via Agreement Testing.

Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

On List Recovery of High-Rate Tensor Codes.

Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas

Proceedings of the Approximation, 2019

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 versus Errors in Local Decoding and Property Testing.

Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma

Electron. Colloquium Comput. Complex., 2018

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

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound.

Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Local List Recovery of High-Rate Tensor Codes & Applications.

Brett Hemenway, Noga Ron-Zewi, Mary Wootters

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity.

Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Towards Optimal Deterministic Coding for Interactive Communication.

Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On Public Key Encryption from Noisy Codewords.

Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi

Proceedings of the Public-Key Cryptography - PKC 2016, 2016

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

High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity.

Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf

Electron. Colloquium Comput. Complex., 2015

2014

Additive combinatorics methods in computational complexity.

Noga Ron-Zewi

PhD thesis, 2014

Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications.

Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Absolutely Sound Testing of Lifted Codes.

Elad Haramaty, Noga Ron-Zewi, Madhu Sudan

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Vector representation of graph domination.

Noga Zewi

J. Graph Theory, 2012

Sparse Affine-Invariant Linear Codes Are Locally Testable.

Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

An Additive Combinatorics Approach Relating Rank to Communication Complexity.

Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Space Complexity in Polynomial Calculus.

Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi

Proceedings of the 27th Conference on Computational Complexity, 2012

A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes.

Noga Ron-Zewi, Madhu Sudan

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

An additive combinatorics approach to the log-rank conjecture in communication complexity.

Eli Ben-Sasson, Shachar Lovett, Noga Zewi

Electron. Colloquium Comput. Complex., 2011

From affine to two-source extractors via approximate duality.

Noga Zewi, Eli Ben-Sasson

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011