Noga Ron‐Zewi

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)	2024	Noga Ron‐Zewi Ronen Shaltiel Nithin Varma
+ PDF Chat	Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size	2024	Noga Ron‐Zewi S. Venkitesh Mary Wootters
+	Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes	2023	Swastik Kopparty Noga Ron‐Zewi Shubhangi Saraf
+	Finer-grained Reductions in Fine-grained Hardness of Approximation	2023	Elie Abboud Noga Ron‐Zewi
+ PDF Chat	Efficient List-Decoding With Constant Alphabet and List Sizes	2021	Zeyu Guo Noga Ron‐Zewi
+ PDF Chat	Low-Density Parity-Check Codes Achieve List-Decoding Capacity	2021	Jonathan Mosheiff Nicolas Resch Noga Ron‐Zewi Shashwat Silas Mary Wootters
+ PDF Chat	Efficient list-decoding with constant alphabet and list sizes	2021	Zeyu Guo Noga Ron‐Zewi
+ PDF Chat	Linear-Time Erasure List-Decoding of Expander Codes	2021	Noga Ron‐Zewi Mary Wootters Gilles Zémor
+ PDF Chat	LDPC Codes Achieve List Decoding Capacity	2020	Jonathan Mosheiff Nicolas Resch Noga Ron‐Zewi Shashwat Silas Mary Wootters
+ PDF Chat	Linear-time Erasure List-decoding of Expander Codes	2020	Noga Ron‐Zewi Mary Wootters Gilles Zémor
+	Linear-time Erasure List-decoding of Expander Codes	2020	Noga Ron‐Zewi Mary Wootters Gilles Zémor
+	Locally testable codes via high-dimensional expanders	2020	Yotam Dikstein Irit Dinur Prahladh Harsha Noga Ron‐Zewi
+	Efficient List-Decoding with Constant Alphabet and List Sizes	2020	Zeyu Guo Noga Ron‐Zewi
+	Linear-time Erasure List-decoding of Expander Codes	2020	Noga Ron‐Zewi Mary Wootters Gilles Zémor
+ PDF Chat	Local List Recovery of High-Rate Tensor Codes and Applications	2019	Brett Hemenway Noga Ron‐Zewi Mary Wootters
+	LDPC Codes Achieve List Decoding Capacity	2019	Jonathan Mosheiff Nicolas Resch Noga Ron‐Zewi Shashwat Silas Mary Wootters
+	LDPC Codes Achieve List-Decoding Capacity.	2019	Jonathan Mosheiff Nicolas Resch Noga Ron‐Zewi Shashwat Silas Mary Wootters
+	LDPC Codes Achieve List Decoding Capacity	2019	Jonathan Mosheiff Nicolas Resch Noga Ron‐Zewi Shashwat Silas Mary Wootters
+ PDF Chat	Improved Decoding of Folded Reed-Solomon and Multiplicity Codes	2018	Swastik Kopparty Noga Ron‐Zewi Shubhangi Saraf Mary Wootters
+	Improved decoding of Folded Reed-Solomon and Multiplicity Codes.	2018	Swastik Kopparty Noga Ron‐Zewi Shubhangi Saraf Mary Wootters
+	Improved decoding of Folded Reed-Solomon and Multiplicity Codes	2018	Swastik Kopparty Noga Ron‐Zewi Shubhangi Saraf Mary Wootters
+	Local List Recovery of High-rate Tensor Codes and Applications	2017	Brett Hemenway Noga Ron‐Zewi Mary Wootters
+ PDF Chat	High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity	2017	Swastik Kopparty Or Meir Noga Ron‐Zewi Shubhangi Saraf
+	Local List Recovery of High-rate Tensor Codes and Applications	2017	Brett Hemenway Noga Ron‐Zewi Mary Wootters
+ PDF Chat	High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity	2016	Swastik Kopparty Or Meir Noga Ron‐Zewi Shubhangi Saraf
+	High rate locally-correctable and locally-testable codes with sub-polynomial query complexity	2015	Swastik Kopparty Or Meir Noga Ron‐Zewi Shubhangi Saraf
+	From Affine to Two-Source Extractors via Approximate Duality	2015	Eli Ben‐Sasson Noga Ron‐Zewi
+	High rate locally-correctable and locally-testable codes with sub-polynomial query complexity	2015	Swastik Kopparty Or Meir Noga Ron‐Zewi Shubhangi Saraf
+ PDF Chat	An Additive Combinatorics Approach Relating Rank to Communication Complexity	2014	Eli Ben‐Sasson Shachar Lovett Noga Ron‐Zewi
+ PDF Chat	Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications	2014	Eli Ben‐Sasson Noga Ron‐Zewi Madhur Tulsiani Julia Wolf
+ PDF Chat	An Additive Combinatorics Approach Relating Rank to Communication Complexity	2012	Eli Ben‐Sasson Shachar Lovett Noga Ron‐Zewi
+	A new upper bound on the query complexity for testing generalized Reed-Muller codes	2012	Noga Ron‐Zewi Madhu Sudan
+ PDF Chat	A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes	2012	Noga Ron‐Zewi Madhu Sudan
+	A new upper bound on the query complexity for testing generalized Reed-Muller codes	2012	Noga Ron‐Zewi Madhu Sudan
+	An additive combinatorics approach to the log-rank conjecture in communication complexity	2011	Eli Ben‐Sasson Shachar Lovett Noga Ron‐Zewi
+	From affine to two-source extractors via approximate duality	2011	Noga Ron‐Zewi Eli Ben‐Sasson
+	Vector representation of graph domination	2011	Noga Ron‐Zewi
+	An additive combinatorics approach to the log-rank conjecture in communication complexity	2011	Eli Ben‐Sasson Shachar Lovett Noga Ron‐Zewi

Common Coauthors

Coauthor	Papers Together
Mary Wootters	16
Swastik Kopparty	8
Shubhangi Saraf	8
Eli Ben‐Sasson	7
Nicolas Resch	5
Shashwat Silas	5
Jonathan Mosheiff	5
Gilles Zémor	4
Shachar Lovett	4
Or Meir	4
Zeyu Guo	3
Madhu Sudan	3
Brett Hemenway	3
Julia Wolf	1
Yotam Dikstein	1
Prahladh Harsha	1
Irit Dinur	1
Madhur Tulsiani	1
Ronen Shaltiel	1
Nithin Varma	1
Elie Abboud	1
S. Venkitesh	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy	2008	Venkatesan Guruswami Atri Rudra	11
+ PDF Chat	Folded codes from function field towers and improved optimal rate list decoding	2012	Venkatesan Guruswami Chaoping Xing	9
+ PDF Chat	Linear-time list recovery of high-rate expander codes	2018	Brett Hemenway Mary Wootters	8
+	A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four	1998	W. T. Gowers	7
+ PDF Chat	Improved Decoding of Folded Reed-Solomon and Multiplicity Codes	2018	Swastik Kopparty Noga Ron‐Zewi Shubhangi Saraf Mary Wootters	7
+	Subspace evasive sets	2012	Zeev Dvir Shachar Lovett	6
+ PDF Chat	Some improvements to total degree tests	2002	Karl E. Friedl Madhu Sudan	6
+	Local correctability of expander codes	2014	Brett Hemenway Rafail Ostrovsky Mary Wootters	6
+	A statistical theorem of set addition	1994	Antal Balog Endre Szemer�di	5
+	Finite field models in additive combinatorics	2005	Ben Green	5
+ PDF Chat	A Probabilistic Technique for Finding Almost-Periods of Convolutions	2010	Ernie Croot Olof Sisask	5
+ PDF Chat	Local List Recovery of High-Rate Tensor Codes and Applications	2019	Brett Hemenway Noga Ron‐Zewi Mary Wootters	5
+	Rank and chromatic number of a graph	1997	Andreı̌ Kotlov	4
+ PDF Chat	High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity	2017	Swastik Kopparty Or Meir Noga Ron‐Zewi Shubhangi Saraf	4
+	From affine to two-source extractors via approximate duality	2011	Noga Ron‐Zewi Eli Ben‐Sasson	4
+ PDF Chat	An analog of Freiman's theorem in groups	2018	Imre Z. RUZSA	4
+ PDF Chat	On the Bogolyubov–Ruzsa lemma	2012	Tom Sanders	4
+ PDF Chat	A Note on Freĭman's Theorem in Vector Spaces	2007	Tom Sanders	4
+ PDF Chat	An equivalence between inverse sumset theorems and inverse conjectures for the<i>U</i><sup>3</sup>norm	2010	Ben Green Terence Tao	4
+ PDF Chat	On the weight distribution of random binary linear codes	2019	Nati Linial Jonathan Mosheiff	4
+ PDF Chat	Erasure List-Decodable Codes From Random and Algebraic Geometry Codes	2014	Yang Ding Lingfei Jin Chaoping Xing	3
+ PDF Chat	Distance properties of expander codes	2005	Alexander Barg Gilles Zémor	3
+ PDF Chat	Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation	2013	Shrinivas Kudekar Tom Richardson Rüdiger Urbanke	3
+	Additive Combinatorics	2006	Terence Tao Van H. Vu	3
+ PDF Chat	Every list-decodable code for high noise has abundant near-optimal rate puncturings	2014	Atri Rudra Mary Wootters	3
+	λ1, Isoperimetric inequalities for graphs, and superconcentrators	1985	Noga Alon Vitali Milman	3
+ PDF Chat	New affine-invariant codes from lifting	2013	Alan Guo Swastik Kopparty Madhu Sudan	3
+ PDF Chat	Freiman's Theorem in Finite Fields via Extremal Set Theory	2009	Ben Green Terence Tao	3
+ PDF Chat	Some remarks on multiplicity codes	2014	Swastik Kopparty	3
+ PDF Chat	On the List-Decodability of Random Linear Codes	2011	Venkatesan Guruswami Johan Håstad Swastik Kopparty	3
+ PDF Chat	Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval	2005	Stephanie Wehner Ronald de Wolf	3
+ PDF Chat	A combination of testability and decodability by tensor products	2013	Michael Viderman	3
+ PDF Chat	On the list decodability of random linear codes with large error rates	2013	Mary Wootters	3
+ PDF Chat	LDPC Codes Achieve List Decoding Capacity	2020	Jonathan Mosheiff Nicolas Resch Noga Ron‐Zewi Shashwat Silas Mary Wootters	3
+	Thresholds versus fractional expectation-thresholds	2019	Keith Frankston Jeff Kahn Bhargav Narayanan Jinyoung Park	3
+	L2/L2-foreach sparse recovery with low risk	2013	Anna C. Gilbert Hung Q. Ngo Ely Porat Atri Rudra Martin J. Strauss	3
+ PDF Chat	Low-degree tests at large distances	2007	Alex Samorodnitsky	3
+ PDF Chat	Difference equations, isoperimetric inequality and transience of certain random walks	1984	Józef Dodziuk	3
+	A Bound for the Chromatic Number of a Graph	1976	Cyriel van Nuffelen	3
+	Deletion Codes in the High-Noise and High-Rate Regimes	2017	Venkatesan Guruswami Carol Wang	3
+ PDF Chat	Explicit construction of linear sized tolerant networks	1988	Noga Alon Fan Chung	3
+ PDF Chat	Improved Nearly-MDS Expander Codes	2006	Ron M. Roth Vitaly Skachek	3
+	Optimal rate algebraic list decoding using narrow ray class fields	2014	Venkatesan Guruswami Chaoping Xing	2
+	Iterative Decoding of Low-Density Parity Check Codes (A Survey)	2006	Venkatesan Guruswami	2
+ PDF Chat	Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers	2009	Kiran S. Kedlaya Sergey Yekhanin	2
+	On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields	1996	Arnaldo Garcia Henning Stichtenoth	2
+ PDF Chat	On a Certain Generalization of the Balog–Szemerédi–Gowers Theorem	2011	Evan Borenstein Ernie Croot	2
+	Equivalence of polynomial conjectures in additive combinatorics.	2010	Shachar Lovett	2
+	Analysis of Boolean Functions	2014	Ryan O’Donnell	2
+ PDF Chat	SETS WITH SMALL SUMSET AND RECTIFICATION	2006	Ben Green Imre Z. Ruzsa	2