| 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 | 101 | 2017 |
| Local proofs approaching the witness length N Ron-Zewi, R Rothblum Journal of the ACM 71 (3), 1-42, 2024 | 61 | 2024 |
| 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 | 59 | 2015 |
| 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 | 53 | 2019 |
| 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 | 53* | 2018 |
| 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 | 49 | 2011 |
| 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 | 44 | 2022 |
| 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 | 42 | 2018 |
| 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 | 39 | 2016 |
| 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 | 38 | 2014 |
| 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 | 35 | 2020 |
| Locally testable codes via high-dimensional expanders Y Dikstein, I Dinur, P Harsha, N Ron-Zewi arXiv preprint arXiv:2005.01045, 2020 | 23 | 2020 |
| 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 | 21 | 2020 |
| 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 | 16 | 2021 |
| Sparse affine-invariant linear codes are locally testable E Ben-Sasson, N Ron-Zewi, M Sudan computational complexity 26, 37-77, 2017 | 16 | 2017 |
| 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 | 15 | 2018 |
| Erasures versus errors in local decoding and property testing S Raskhodnikova, N Ron‐Zewi, N Varma Random Structures & Algorithms 59 (4), 640-670, 2021 | 14 | 2021 |
| 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 | 13 | 2012 |
| Absolutely sound testing of lifted codes E Haramaty, N Ron-Zewi, M Sudan International Workshop on Approximation Algorithms for Combinatorial …, 2013 | 12 | 2013 |
| 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 | 11 | 2021 |
Shubhangi SarafRutgers Universityrutgers.edu üzerinde doğrulanmış e-posta adresine sahip