For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.

Dr. N.A. (Nicolas) Resch PhD

Faculty of Science
Informatics Institute
Visiting address
  • Science Park 904
Postal address
  • Postbus 94323
    1090 GH Amsterdam
Contact details
  • Publications

    2023

    • Attema, T., Fehr, S., & Resch, N. (2023). Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. In G. Rothblum, & H. Wee (Eds.), Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29–December 2, 2023 : proceedings (Vol. III, pp. 424-454). (Lecture Notes in Computer Science; Vol. 14371). Springer. https://doi.org/10.1007/978-3-031-48621-0_15 [details]
    • Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., & Scholl, P. (2023). Oblivious Transfer with Constant Computational Overhead. In C. Hazay, & M. Stam (Eds.), Advances in Cryptology – EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 271-302). (Lecture Notes in Computer Science; Vol. 14004). Springer. https://doi.org/10.1007/978-3-031-30545-0_10
    • Debris-Alazard, T., Ducas, L., Resch, N., & Tillich, J. P. (2023). Smoothing Codes and Lattices: Systematic Study and New Bounds. IEEE Transactions on Information Theory, 69(9), 6006-6027. https://doi.org/10.1109/TIT.2023.3276921
    • Efremenko, K., Haeupler, B., Kalai, Y. T., Kol, G., Resch, N., & Saxena, R. R. (2023). Interactive Coding with Small Memory. In 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023 (pp. 3587-3613). Association for Computing Machinery.
    • Resch, N., & Yuan, C. (2023). Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography, ITC 2023 Article 1 (Leibniz International Proceedings in Informatics; Vol. 267). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2023.1
    • Resch, N., Yuan, C., & Zhang, Y. (2023). Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming: ICALP 2023, July 10-14, 2023, Paderborn, Germany Article 99 (Leibniz International Proceedings in Informatics; Vol. 261). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.99

    2022

    • Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., & Scholl, P. (2022). Correlated Pseudorandomness from Expand-Accumulate Codes. In Y. Dodis, & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15–18, 2022 : proceedings (pp. 603-633). (Lecture Notes in Computer Science; Vol. 13508). Springer. https://doi.org/10.1007/978-3-031-15979-4_21 [details]
    • Efremenko, K., Haeupler, B., Tauman Kalai, Y., Kamath, P., Kol, G., Resch, N., & Saxena, R. R. (2022). Circuits resilient to short-circuit errors. In S. Leonardi, & A. Gupta (Eds.), STOC '22: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing : June 20-24, 2022, Rome, Italy (pp. 582-594). Association for Computing Machinery. https://doi.org/10.1145/3519935.3520007 [details]
    • Guruswami, V., Li, R., Mosheiff, J., Resch, N., Silas, S., & Wootters, M. (2022). Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Transactions on Information Theory, 68(2), 923-939. https://doi.org/10.1109/TIT.2021.3127126
    • Guruswami, V., Moshieff, J., Resch, N., Silas, S., & Wootters, M. (2022). Threshold Rates for Properties of Random Codes. IEEE Transactions on Information Theory, 68(2), 905-922. https://doi.org/10.1109/TIT.2021.3123497
    • Resch, N., & Yuan, C. (2022). Threshold Rates of Code Ensembles: Linear Is Best. In M. Bojańczyk, E. Merelli, & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming: ICALP 2022, July 4-8, 2022, Paris, France Article 104 (Leibniz International Proceedings in Informatics; Vol. 229). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.48550/arXiv.2205.01513, https://doi.org/10.4230/LIPIcs.ICALP.2022.104 [details]

    2021

    • Guruswami, V., Mosheiff, J., Resch, N., Silas, S., & Wootters, M. (2021). Sharp threshold rates for random codes. In J. R. Lee (Ed.), 12th Innovations in Theoretical Computer Science Conference, ITCS 2021 Article 5 (Leibniz International Proceedings in Informatics; Vol. 185). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2021.5
    • Guruswami, V., Resch, N., & Xing, C. (2021). Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs. Combinatorica, 41(4), 545-579. https://doi.org/10.1007/s00493-020-4360-1
    • Kopparty, S., Resch, N., Ron-Zewi, N., Saraf, S., & Silas, S. (2021). On List Recovery of High-Rate Tensor Codes. IEEE Transactions on Information Theory, 67(1), 296-316. https://doi.org/10.1109/TIT.2020.3023962

    2020

    • Guruswami, V., Li, R., Mosheiff, J., Resch, N., Silas, S., & Wootters, M. (2020). Bounds for list-decoding and list-recovery of random linear codes. In J. Byrka, & R. Meka (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020 Article APPROX9 (Leibniz International Proceedings in Informatics; Vol. 176). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.9
    • Mosheiff, J., Resch, N., Ron-Zewi, N., Silas, S., & Wootters, M. (2020). Ldpc codes achieve list decoding capacity. In Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (pp. 458-469). Article 9317881 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 2020-November). IEEE Computer Society Press. https://doi.org/10.1109/FOCS46700.2020.00050

    2019

    • Kopparty, S., Resch, N., Ron-Zewi, N., Saraf, S., & Silas, S. (2019). On list recovery of high-rate tensor codes. In D. Achlioptas, & L. A. Vegh (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019 Article 68 (Leibniz International Proceedings in Informatics; Vol. 145). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.68

    2018

    • Guruswami, V., & Resch, N. (2018). On the List-Decodability of Random Linear Rank-Metric Codes. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 1505-1509). Article 8437698 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437698
    • Guruswami, V., Resch, N., & Xing, C. (2018). Lossless dimension expanders via linearized polynomials and subspace designs. In R. A. Servedio (Ed.), 33rd Computational Complexity Conference, CCC 2018 (pp. 41-416). (Leibniz International Proceedings in Informatics; Vol. 102). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2018.4
    This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list.
  • Ancillary activities
    No ancillary activities
edit contact information   edit profile page