Obserwuj
Noga Ron-Zewi
Noga Ron-Zewi
Zweryfikowany adres z cs.haifa.ac.il - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
High-rate locally correctable and locally testable codes with sub-polynomial query complexity
S Kopparty, O Meir, N Ron-Zewi, S Saraf
Journal of the ACM (JACM) 64 (2), 1-42, 2017
922017
Space complexity in polynomial calculus
Y Filmus, M Lauria, J Nordstrom, N Ron-Zewi, N Thapen
SIAM Journal on Computing 44 (4), 1119-1153, 2015
582015
Local proofs approaching the witness length
N Ron-Zewi, R Rothblum
Journal of the ACM, 2019
492019
Local list recovery of high-rate tensor codes and applications
B Hemenway, N Ron-Zewi, M Wootters
SIAM Journal on Computing 49 (4), FOCS17-157-FOCS17-195, 2019
462019
From affine to two-source extractors via approximate duality
N Zewi, E Ben-Sasson
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
462011
Improved decoding of folded Reed-Solomon and multiplicity codes
S Kopparty, N Ron-Zewi, S Saraf, M Wootters
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
39*2018
Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound
S Gopi, S Kopparty, R Oliveira, N Ron-Zewi, S Saraf
IEEE Transactions on Information Theory 64 (8), 5813-5831, 2018
382018
An additive combinatorics approach relating rank to communication complexity
E Ben-Sasson, S Lovett, N Ron-Zewi
Journal of the ACM (JACM) 61 (4), 1-18, 2014
342014
Proving as fast as computing: succinct arguments with constant prover overhead
N Ron-Zewi, RD Rothblum
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
332022
Towards optimal deterministic coding for interactive communication
R Gelles, B Haeupler, G Kol, N Ron-Zewi, A Wigderson
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
332016
LDPC codes achieve list decoding capacity
J Mosheiff, N Resch, N Ron-Zewi, S Silas, M Wootters
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
322020
Locally testable codes via high-dimensional expanders
Y Dikstein, I Dinur, P Harsha, N Ron-Zewi
arXiv preprint arXiv:2005.01045, 2020
182020
On list recovery of high-rate tensor codes
S Kopparty, N Resch, N Ron-Zewi, S Saraf, S Silas
IEEE Transactions on Information Theory 67 (1), 296-316, 2020
162020
Sparse affine-invariant linear codes are locally testable
E Ben-Sasson, N Ron-Zewi, M Sudan
computational complexity 26, 37-77, 2017
162017
Explicit capacity approaching coding for interactive communication
R Gelles, B Haeupler, G Kol, N Ron-Zewi, A Wigderson
IEEE Transactions on Information Theory 64 (10), 6546-6560, 2018
142018
Efficient list-decoding with constant alphabet and list sizes
Z Guo, N Ron-Zewi
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
132021
Absolutely sound testing of lifted codes
E Haramaty, N Ron-Zewi, M Sudan
International Workshop on Approximation Algorithms for Combinatorial …, 2013
122013
A new upper bound on the query complexity for testing generalized reed-muller codes
N Ron-Zewi, M Sudan
International Workshop on Approximation Algorithms for Combinatorial …, 2012
122012
Erasures vs. errors in local decoding and property testing
S Raskhodnikova, N Ron-Zewi, N Varma
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019
112019
Linear-time erasure list-decoding of expander codes
N Ron-Zewi, M Wootters, G Zémor
IEEE Transactions on Information Theory 67 (9), 5827-5839, 2021
92021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20