Noga Ron-Zewi

94 papers A* 12A 5B 1Journal 68Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes.
CoRR
Noga Ron-Zewi, Mor Weiss
2026 J jnl
A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes.
Electron. Colloquium Comput. Complex.
Noga Ron-Zewi, Mor Weiss
2026 J jnl
A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes.
IACR Cryptol. ePrint Arch.
Noga Ron-Zewi, Mor Weiss
2026 J jnl
Advances in List Decoding of Polynomial Codes.
CoRR
Mrinal Kumar, Noga Ron-Zewi
2026 J jnl
Advances in List Decoding of Polynomial Codes.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Noga Ron-Zewi
2025 J jnl
Efficient Decoding of Double-circulant and Wozencraft Codes from Square-root Errors.
CoRR
Oren Dubin, Noam Oz, Noga Ron-Zewi
2025 J jnl
Finer-grained reductions in fine-grained hardness of approximation.
Theor. Comput. Sci.
Elie Abboud, Noga Ron-Zewi
2025 — conf
Linear Prover IOPs in Log Star Rounds.
TCC (1)
Noor Athamnah, Noga Ron-Zewi, Ron D. Rothblum
2025 J jnl
Linear Prover IOPs in Log Star Rounds.
Electron. Colloquium Comput. Complex.
Noor Athamnah, Noga Ron-Zewi, Ron Rothblum
2025 J jnl
Linear Prover IOPs in Log Star Rounds.
IACR Cryptol. ePrint Arch.
Noor Athamnah, Noga Ron-Zewi, Ron D. Rothblum
2025 J jnl
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead.
J. ACM
Noga Ron-Zewi, Ron Rothblum
2024 A ed.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024, London School of Economics, London, UK, August 28-30, 2024
APPROX/RANDOM
Amit Kumar, Noga Ron-Zewi
2024 A* conf
Finer-Grained Reductions in Fine-Grained Hardness of Approximation.
ICALP
Elie Abboud, Noga Ron-Zewi
2024 J jnl
Local Proofs Approaching the Witness Length.
J. ACM
Noga Ron-Zewi, Ron Rothblum
2024 J jnl
Low-Density Parity-Check Codes Achieve List-Decoding Capacity.
SIAM J. Comput.
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
2024 J jnl
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists).
CoRR
Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma
2024 — conf
Zero-Knowledge IOPs Approaching Witness Length.
CRYPTO (10)
Noga Ron-Zewi, Mor Weiss
2024 J jnl
Zero-knowledge IOPs Approaching Witness Length.
IACR Cryptol. ePrint Arch.
Noga Ron-Zewi, Mor Weiss
2023 J jnl
Finer-grained Reductions in Fine-grained Hardness of Approximation.
CoRR
Elie Abboud, Noga Ron-Zewi
2023 J jnl
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes.
SIAM J. Comput.
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
2023 J jnl
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes.
CoRR
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
2023 J jnl
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes.
Electron. Colloquium Comput. Complex.
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
2022 J jnl
Efficient List-Decoding With Constant Alphabet and List Sizes.
IEEE Trans. Inf. Theory
Zeyu Guo, Noga Ron-Zewi
2022 J jnl
From Local to Robust Testing via Agreement Testing.
Theory Comput.
Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
2022 A* conf
Proving as fast as computing: succinct arguments with constant prover overhead.
STOC
Noga Ron-Zewi, Ron D. Rothblum
2022 J jnl
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020).
SIAM J. Comput.
Arkadev Chattopadhyay, Marek Cygan, Noga Ron-Zewi, Christian Wulff-Nilsen
2021 A* conf
Efficient list-decoding with constant alphabet and list sizes.
STOC
Zeyu Guo, Noga Ron-Zewi
2021 J jnl
Erasures versus errors in local decoding and property testing.
Random Struct. Algorithms
Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma
2021 J jnl
Linear-Time Erasure List-Decoding of Expander Codes.
IEEE Trans. Inf. Theory
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
2021 J jnl
On List Recovery of High-Rate Tensor Codes.
IEEE Trans. Inf. Theory
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
2021 J jnl
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead.
Electron. Colloquium Comput. Complex.
Noga Ron-Zewi, Ron Rothblum
2021 J jnl
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead.
IACR Cryptol. ePrint Arch.
Noga Ron-Zewi, Ron D. Rothblum
2021 A conf
Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists).
ITCS
Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma
2021 J jnl
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword.
Theory Comput.
Noga Ron-Zewi, Ivona Bezáková, László A. Végh
2020 J jnl
Efficient List-Decoding with Constant Alphabet and List Sizes.
CoRR
Zeyu Guo, Noga Ron-Zewi
2020 J jnl
Efficient List-Decoding with Constant Alphabet and List Sizes.
Electron. Colloquium Comput. Complex.
Zeyu Guo, Noga Ron-Zewi
2020 A* conf
LDPC Codes Achieve List Decoding Capacity.
FOCS
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
2020 B conf
Linear-time Erasure List-decoding of Expander Codes.
ISIT
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
2020 J jnl
Linear-time Erasure List-decoding of Expander Codes.
CoRR
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
2020 J jnl
Linear-time Erasure List-decoding of Expander Codes.
Electron. Colloquium Comput. Complex.
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
2020 J jnl
Local List Recovery of High-Rate Tensor Codes and Applications.
SIAM J. Comput.
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
2020 A* conf
Local Proofs Approaching the Witness Length [Extended Abstract].
FOCS
Noga Ron-Zewi, Ron D. Rothblum
2020 J jnl
Locally testable codes via high-dimensional expanders.
CoRR
Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
2020 J jnl
Locally testable codes via high-dimensional expanders.
Electron. Colloquium Comput. Complex.
Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
2020 J jnl
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists).
Electron. Colloquium Comput. Complex.
Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma
2019 A conf
Erasures vs. Errors in Local Decoding and Property Testing.
ITCS
Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma
2019 A conf
From Local to Robust Testing via Agreement Testing.
ITCS
Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
2019 J jnl
LDPC Codes Achieve List Decoding Capacity.
CoRR
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
2019 J jnl
LDPC Codes Achieve List-Decoding Capacity.
Electron. Colloquium Comput. Complex.
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
2019 J jnl
Local Proofs Approaching the Witness Length.
Electron. Colloquium Comput. Complex.
Noga Ron-Zewi, Ron Rothblum
2019 J jnl
Local Proofs Approaching the Witness Length.
IACR Cryptol. ePrint Arch.
Noga Ron-Zewi, Ron D. Rothblum
2019 — conf
On List Recovery of High-Rate Tensor Codes.
APPROX-RANDOM
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
2019 J jnl
On List Recovery of High-Rate Tensor Codes.
Electron. Colloquium Comput. Complex.
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
2018 J jnl
Erasures versus Errors in Local Decoding and Property Testing.
Electron. Colloquium Comput. Complex.
Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma
2018 J jnl
Explicit Capacity Approaching Coding for Interactive Communication.
IEEE Trans. Inf. Theory
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson
2018 J jnl
From Local to Robust Testing via Agreement Testing.
Electron. Colloquium Comput. Complex.
Irit Dinur, Tali Kaufman, Noga Ron-Zewi
2018 A* conf
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes.
FOCS
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
2018 J jnl
Improved decoding of Folded Reed-Solomon and Multiplicity Codes.
CoRR
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
2018 J jnl
Improved decoding of Folded Reed-Solomon and Multiplicity Codes.
Electron. Colloquium Comput. Complex.
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
2018 J jnl
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound.
IEEE Trans. Inf. Theory
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
2017 J jnl
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity.
J. ACM
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2017 A* conf
Local List Recovery of High-Rate Tensor Codes & Applications.
FOCS
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
2017 J jnl
Local List Recovery of High-rate Tensor Codes & Applications.
Electron. Colloquium Comput. Complex.
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
2017 J jnl
Local List Recovery of High-rate Tensor Codes and Applications.
CoRR
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
2017 A* conf
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound.
SODA
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
2017 J jnl
Sparse affine-invariant linear codes are locally testable.
Comput. Complex.
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
2016 A* conf
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity.
STOC
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2016 J jnl
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound.
Electron. Colloquium Comput. Complex.
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
2016 — conf
On Public Key Encryption from Noisy Codewords.
Public Key Cryptography (2)
Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi
2016 A* conf
Towards Optimal Deterministic Coding for Interactive Communication.
SODA
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson
2015 J jnl
Absolutely Sound Testing of Lifted Codes.
Theory Comput.
Elad Haramaty, Noga Ron-Zewi, Madhu Sudan
2015 J jnl
From Affine to Two-Source Extractors via Approximate Duality.
SIAM J. Comput.
Eli Ben-Sasson, Noga Ron-Zewi
2015 J jnl
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity.
CoRR
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2015 J jnl
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity.
Electron. Colloquium Comput. Complex.
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
2015 J jnl
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity.
Electron. Colloquium Comput. Complex.
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2015 J jnl
On Public Key Encryption from Noisy Codewords.
Electron. Colloquium Comput. Complex.
Eli Ben-Sasson, Iddo Bentov, Ivan Bjerre Damgård, Yuval Ishai, Noga Ron-Zewi
2015 J jnl
On Public Key Encryption from Noisy Codewords.
IACR Cryptol. ePrint Arch.
Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi
2015 J jnl
Space Complexity in Polynomial Calculus.
SIAM J. Comput.
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
2015 J jnl
Towards Optimal Deterministic Coding for Interactive Communication.
Electron. Colloquium Comput. Complex.
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson
2014 — —
Additive combinatorics methods in computational complexity.
Noga Ron-Zewi
2014 J jnl
An Additive Combinatorics Approach Relating Rank to Communication Complexity.
J. ACM
Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi
2014 — conf
Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications.
ICALP (1)
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
2013 J jnl
A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes.
Theory Comput.
Noga Ron-Zewi, Madhu Sudan
2013 — conf
Absolutely Sound Testing of Lifted Codes.
APPROX-RANDOM
Elad Haramaty, Noga Ron-Zewi, Madhu Sudan
2013 J jnl
Absolutely Sound Testing of Lifted Codes.
Electron. Colloquium Comput. Complex.
Elad Haramaty, Noga Ron-Zewi, Madhu Sudan
2012 — conf
A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes.
APPROX-RANDOM
Noga Ron-Zewi, Madhu Sudan
2012 J jnl
A new upper bound on the query complexity for testing generalized Reed-Muller codes
CoRR
Noga Ron-Zewi, Madhu Sudan
2012 A* conf
An Additive Combinatorics Approach Relating Rank to Communication Complexity.
FOCS
Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi
2012 J jnl
Sampling-based proofs of almost-periodicity results and algorithmic applications
CoRR
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
2012 J jnl
Sampling-based proofs of almost-periodicity results and algorithmic applications.
Electron. Colloquium Comput. Complex.
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
2012 A conf
Space Complexity in Polynomial Calculus.
CCC
Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi
2012 J jnl
Space Complexity in Polynomial Calculus.
Electron. Colloquium Comput. Complex.
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
2012 A* conf
Sparse Affine-Invariant Linear Codes Are Locally Testable.
FOCS
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
2012 J jnl
Sparse affine-invariant linear codes are locally testable.
Electron. Colloquium Comput. Complex.
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan