| 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 | 31 | 2020 |
| Correlated pseudorandomness from expand-accumulate codes E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, N Resch, P Scholl Annual International Cryptology Conference, 603-633, 2022 | 26 | 2022 |
| Bounds for list-decoding and list-recovery of random linear codes V Guruswami, R Li, J Mosheiff, N Resch, S Silas, M Wootters arXiv preprint arXiv:2004.13247, 2020 | 15 | 2020 |
| Smoothing codes and lattices: Systematic study and new bounds T Debris-Alazard, L Ducas, N Resch, JP Tillich IEEE Transactions on Information Theory, 2023 | 14 | 2023 |
| Lossless dimension expanders via linearized polynomials and subspace designs V Guruswami, N Resch, C Xing Combinatorica, 1-35, 2021 | 12 | 2021 |
| On the list-decodability of random linear rank-metric codes V Guruswami, N Resch 2018 IEEE International Symposium on Information Theory (ISIT), 1505-1509, 2018 | 11 | 2018 |
| 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 | 9 | 2020 |
| List-decodable codes:(randomized) constructions and applications N Resch School Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA, Tech. Rep …, 2020 | 9 | 2020 |
| On list recovery of high-rate tensor codes S Kopparty, N Resch, N Ron-Zewi, S Saraf, S Silas Leibniz international proceedings in informatics, 2019 | 9 | 2019 |
| Worst and average case hardness of decoding via smoothing bounds T Debris-Alazard, N Resch Cryptology ePrint Archive, 2022 | 8 | 2022 |
| Bounds for list-decoding and list-recovery of random linear codes V Guruswami, R Li, J Mosheiff, N Resch, S Silas, M Wootters IEEE Transactions on Information Theory 68 (2), 923-939, 2021 | 8 | 2021 |
| Sharp threshold rates for random codes V Guruswami, J Mosheiff, N Resch, S Silas, M Wootters arXiv preprint arXiv:2009.04553, 2020 | 6 | 2020 |
| Generalized special-sound interactive proofs and their knowledge soundness T Attema, S Fehr, N Resch Theory of Cryptography Conference, 424-454, 2023 | 4 | 2023 |
| Threshold rates for properties of random codes V Guruswami, J Mosheiff, N Resch, S Silas, M Wootters IEEE Transactions on Information Theory 68 (2), 905-922, 2021 | 4 | 2021 |
| Oblivious transfer with constant computational overhead E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, N Resch, P Scholl Annual International Conference on the Theory and Applications of …, 2023 | 3 | 2023 |
| Circuits resilient to short-circuit errors K Efremenko, B Haeupler, YT Kalai, P Kamath, G Kol, N Resch, ... Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 3 | 2022 |
| A Generalized Special-Soundness Notion and its Knowledge Extractors T Attema, S Fehr, N Resch IACR Cryptology ePrint Archive, Report 2023/818, 2023 | 2 | 2023 |
| Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery N Resch, C Yuan, Y Zhang arXiv preprint arXiv:2210.07754, 2022 | 2 | 2022 |
| Threshold rates of code ensembles: Linear is best N Resch, C Yuan IEEE Transactions on Information Theory, 2024 | 1 | 2024 |
| Interactive Coding with Small Memory K Efremenko, B Haeupler, YT Kalai, G Kol, N Resch, RR Saxena Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 1 | 2023 |
