default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoga Ron-Zewi
Noga Zewi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j21]Elie Abboud
, Noga Ron-Zewi:
Finer-grained reductions in fine-grained hardness of approximation. Theor. Comput. Sci. 1026: 114976 (2025)- 2024
- [j20]Noga Ron-Zewi, Ron Rothblum:
Local Proofs Approaching the Witness Length. J. ACM 71(3): 18 (2024) - [c24]Noga Ron-Zewi, Mor Weiss:
Zero-Knowledge IOPs Approaching Witness Length. CRYPTO (10) 2024: 105-137 - [c23]Elie Abboud, Noga Ron-Zewi:
Finer-Grained Reductions in Fine-Grained Hardness of Approximation. ICALP 2024: 7:1-7:17 - [e1]Amit Kumar, Noga Ron-Zewi:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024, August 28-30, 2024, London School of Economics, London, UK. LIPIcs 317, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-348-5 [contents] - [i43]Noga Ron-Zewi, S. Venkitesh, Mary Wootters:
Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size. CoRR abs/2401.14517 (2024) - [i42]Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). CoRR abs/2409.01708 (2024) - [i41]Noga Ron-Zewi, Mor Weiss:
Zero-knowledge IOPs Approaching Witness Length. IACR Cryptol. ePrint Arch. 2024: 816 (2024) - 2023
- [j19]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM J. Comput. 52(3): 794-840 (2023) - [i40]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. CoRR abs/2310.19149 (2023) - [i39]Elie Abboud, Noga Ron-Zewi:
Finer-grained Reductions in Fine-grained Hardness of Approximation. CoRR abs/2311.00798 (2023) - [i38]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j18]Arkadev Chattopadhyay, Marek Cygan, Noga Ron-Zewi, Christian Wulff-Nilsen:
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020). SIAM J. Comput. 51(3): 20- (2022) - [j17]Zeyu Guo, Noga Ron-Zewi:
Efficient List-Decoding With Constant Alphabet and List Sizes. IEEE Trans. Inf. Theory 68(3): 1663-1682 (2022) - [j16]Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. Adv. Math. Commun. 18: 1-25 (2022) - [c22]Noga Ron-Zewi, Ron D. Rothblum:
Proving as fast as computing: succinct arguments with constant prover overhead. STOC 2022: 1353-1363 - 2021
- [j15]Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures versus errors in local decoding and property testing. Random Struct. Algorithms 59(4): 640-670 (2021) - [j14]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. IEEE Trans. Inf. Theory 67(1): 296-316 (2021) - [j13]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-Time Erasure List-Decoding of Expander Codes. IEEE Trans. Inf. Theory 67(9): 5827-5839 (2021) - [j12]Noga Ron-Zewi, Ivona Bezáková, László A. Végh:
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Adv. Math. Commun. 17: 1-4 (2021) - [c21]Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). ITCS 2021: 33:1-33:18 - [c20]Zeyu Guo, Noga Ron-Zewi:
Efficient list-decoding with constant alphabet and list sizes. STOC 2021: 1502-1515 - [i37]Noga Ron-Zewi, Ron Rothblum:
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. Electron. Colloquium Comput. Complex. TR21 (2021) - [i36]Noga Ron-Zewi, Ron D. Rothblum:
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. IACR Cryptol. ePrint Arch. 2021: 1673 (2021) - 2020
- [j11]Brett Hemenway, Noga Ron-Zewi, Mary Wootters:
Local List Recovery of High-Rate Tensor Codes and Applications. SIAM J. Comput. 49(4) (2020) - [c19]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List Decoding Capacity. FOCS 2020: 458-469 - [c18]Noga Ron-Zewi, Ron D. Rothblum:
Local Proofs Approaching the Witness Length [Extended Abstract]. FOCS 2020: 846-857 - [c17]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. ISIT 2020: 379-383 - [i35]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. CoRR abs/2002.08579 (2020) - [i34]Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi:
Locally testable codes via high-dimensional expanders. CoRR abs/2005.01045 (2020) - [i33]Zeyu Guo, Noga Ron-Zewi:
Efficient List-Decoding with Constant Alphabet and List Sizes. CoRR abs/2011.05884 (2020) - [i32]Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi:
Locally testable codes via high-dimensional expanders. Electron. Colloquium Comput. Complex. TR20 (2020) - [i31]Zeyu Guo, Noga Ron-Zewi:
Efficient List-Decoding with Constant Alphabet and List Sizes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i30]Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma:
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). Electron. Colloquium Comput. Complex. TR20 (2020) - [i29]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c16]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. APPROX-RANDOM 2019: 68:1-68:22 - [c15]Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. ITCS 2019: 29:1-29:18 - [c14]Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures vs. Errors in Local Decoding and Property Testing. ITCS 2019: 63:1-63:21 - [i28]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List Decoding Capacity. CoRR abs/1909.06430 (2019) - [i27]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. Electron. Colloquium Comput. Complex. TR19 (2019) - [i26]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. TR19 (2019) - [i25]Noga Ron-Zewi, Ron Rothblum:
Local Proofs Approaching the Witness Length. Electron. Colloquium Comput. Complex. TR19 (2019) - [i24]Noga Ron-Zewi, Ron D. Rothblum:
Local Proofs Approaching the Witness Length. IACR Cryptol. ePrint Arch. 2019: 1062 (2019) - 2018
- [j10]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 64(8): 5813-5831 (2018) - [j9]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Explicit Capacity Approaching Coding for Interactive Communication. IEEE Trans. Inf. Theory 64(10): 6546-6560 (2018) - [c13]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. FOCS 2018: 212-223 - [i23]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. CoRR abs/1805.01498 (2018) - [i22]Irit Dinur, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. Electron. Colloquium Comput. Complex. TR18 (2018) - [i21]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. Electron. Colloquium Comput. Complex. TR18 (2018) - [i20]Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures versus Errors in Local Decoding and Property Testing. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j8]Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan:
Sparse affine-invariant linear codes are locally testable. Comput. Complex. 26(1): 37-77 (2017) - [j7]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. J. ACM 64(2): 11:1-11:42 (2017) - [c12]Brett Hemenway, Noga Ron-Zewi, Mary Wootters:
Local List Recovery of High-Rate Tensor Codes & Applications. FOCS 2017: 204-215 - [c11]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. SODA 2017: 2073-2091 - [i19]Brett Hemenway, Noga Ron-Zewi, Mary Wootters:
Local List Recovery of High-rate Tensor Codes and Applications. CoRR abs/1706.03383 (2017) - [i18]Brett Hemenway, Noga Ron-Zewi, Mary Wootters:
Local List Recovery of High-rate Tensor Codes & Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c10]Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. Public Key Cryptography (2) 2016: 417-446 - [c9]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. SODA 2016: 1922-1936 - [c8]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. STOC 2016: 202-215 - [i17]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j6]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. SIAM J. Comput. 44(4): 1119-1153 (2015) - [j5]Eli Ben-Sasson, Noga Ron-Zewi:
From Affine to Two-Source Extractors via Approximate Duality. SIAM J. Comput. 44(6): 1670-1697 (2015) - [j4]Elad Haramaty, Noga Ron-Zewi, Madhu Sudan:
Absolutely Sound Testing of Lifted Codes. Theory Comput. 11: 299-338 (2015) - [i16]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. CoRR abs/1504.05653 (2015) - [i15]Eli Ben-Sasson, Iddo Bentov, Ivan Bjerre Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. Electron. Colloquium Comput. Complex. TR15 (2015) - [i14]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - [i13]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - [i12]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - [i11]Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. IACR Cryptol. ePrint Arch. 2015: 572 (2015) - 2014
- [b1]Noga Ron-Zewi:
Additive combinatorics methods in computational complexity. Technion - Israel Institute of Technology, Israel, 2014 - [j3]Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi:
An Additive Combinatorics Approach Relating Rank to Communication Complexity. J. ACM 61(4): 22:1-22:18 (2014) - [c7]Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf:
Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications. ICALP (1) 2014: 955-966 - 2013
- [j2]Noga Ron-Zewi, Madhu Sudan:
A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes. Theory Comput. 9: 783-807 (2013) - [c6]Elad Haramaty, Noga Ron-Zewi, Madhu Sudan:
Absolutely Sound Testing of Lifted Codes. APPROX-RANDOM 2013: 671-682 - [i10]Elad Haramaty, Noga Ron-Zewi, Madhu Sudan:
Absolutely Sound Testing of Lifted Codes. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j1]Noga Zewi:
Vector representation of graph domination. J. Graph Theory 70(2): 152-170 (2012) - [c5]Noga Ron-Zewi, Madhu Sudan:
A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes. APPROX-RANDOM 2012: 639-650 - [c4]Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi:
Space Complexity in Polynomial Calculus. CCC 2012: 334-344 - [c3]Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi:
An Additive Combinatorics Approach Relating Rank to Communication Complexity. FOCS 2012: 177-186 - [c2]Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan:
Sparse Affine-Invariant Linear Codes Are Locally Testable. FOCS 2012: 561-570 - [i9]Noga Ron-Zewi, Madhu Sudan:
A new upper bound on the query complexity for testing generalized Reed-Muller codes. CoRR abs/1204.5467 (2012) - [i8]Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf:
Sampling-based proofs of almost-periodicity results and algorithmic applications. CoRR abs/1210.6917 (2012) - [i7]Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan:
Sparse affine-invariant linear codes are locally testable. Electron. Colloquium Comput. Complex. TR12 (2012) - [i6]Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf:
Sampling-based proofs of almost-periodicity results and algorithmic applications. Electron. Colloquium Comput. Complex. TR12 (2012) - [i5]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. Electron. Colloquium Comput. Complex. TR12 (2012) - [i4]Madhu Sudan, Noga Zewi:
A new upper bound on the query complexity for testing generalized Reed-Muller codes. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c1]Noga Zewi, Eli Ben-Sasson:
From affine to two-source extractors via approximate duality. STOC 2011: 177-186 - [i3]Eli Ben-Sasson, Shachar Lovett, Noga Zewi:
An additive combinatorics approach to the log-rank conjecture in communication complexity. CoRR abs/1111.5884 (2011) - [i2]Eli Ben-Sasson, Shachar Lovett, Noga Zewi:
An additive combinatorics approach to the log-rank conjecture in communication complexity. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i1]Eli Ben-Sasson, Noga Zewi:
From Affine to Two-Source Extractors via Approximate Duality. Electron. Colloquium Comput. Complex. TR10 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
