default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Resch
Person information
- affiliation: University of Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c15]Nicolas Resch, Chen Yuan, Yihan Zhang:
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. ITCS 2025: 82:1-82:21- [i24]Maxime Bombar, Nicolas Resch, Emiel Wiedijk:
On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography. IACR Cryptol. ePrint Arch. 2025: 18 (2025) - 2024
- [j8]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
Low-Density Parity-Check Codes Achieve List-Decoding Capacity. SIAM J. Comput. 53(6): S20-38 (2024) - [j7]Nicolas Resch
, Chen Yuan:
Threshold Rates of Code Ensembles: Linear Is Best. IEEE Trans. Inf. Theory 70(7): 4823-4842 (2024) - [j6]Nicolas Resch, Chen Yuan, Yihan Zhang:
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. IEEE Trans. Inf. Theory 70(9): 6211-6238 (2024) - [i23]Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan:
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. CoRR abs/2402.11533 (2024) - [i22]Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch, Mary Wootters:
Interactive Coding with Small Memory and Improved Rate. CoRR abs/2408.06541 (2024) - [i21]Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger:
Blaze: Fast SNARKs from Interleaved RAA Codes. IACR Cryptol. ePrint Arch. 2024: 1609 (2024) - 2023
- [j5]Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich:
Smoothing Codes and Lattices: Systematic Study and New Bounds. IEEE Trans. Inf. Theory 69(9): 6006-6027 (2023) - [c14]Nicolas Resch, Chen Yuan:
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. ITC 2023: 1:1-1:20 - [c13]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Oblivious Transfer with Constant Computational Overhead. EUROCRYPT (1) 2023: 271-302 - [c12]Nicolas Resch, Chen Yuan, Yihan Zhang:
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. ICALP 2023: 99:1-99:18 - [c11]Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena:
Interactive Coding with Small Memory. SODA 2023: 3587-3613 - [c10]Thomas Attema, Serge Fehr, Nicolas Resch:
Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. TCC (3) 2023: 424-454 - [i20]Nicolas Resch, Chen Yuan, Yihan Zhang:
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. CoRR abs/2309.01800 (2023) - [i19]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Oblivious Transfer with Constant Computational Overhead. IACR Cryptol. ePrint Arch. 2023: 817 (2023) - [i18]Thomas Attema, Serge Fehr, Nicolas Resch:
A Generalized Special-Soundness Notion and its Knowledge Extractors. IACR Cryptol. ePrint Arch. 2023: 818 (2023) - [i17]Thomas Attema, Serge Fehr, Michael Klooß, Nicolas Resch:
The Fiat-Shamir Transformation of (Γ1,đots,Γμ)-Special-Sound Interactive Proofs. IACR Cryptol. ePrint Arch. 2023: 1945 (2023) - 2022
- [j4]Venkatesan Guruswami, Jonathan Moshieff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Threshold Rates for Properties of Random Codes. IEEE Trans. Inf. Theory 68(2): 905-922 (2022) - [j3]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Trans. Inf. Theory 68(2): 923-939 (2022) - [c9]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Correlated Pseudorandomness from Expand-Accumulate Codes. CRYPTO (2) 2022: 603-633 - [c8]Nicolas Resch, Chen Yuan:
Threshold Rates of Code Ensembles: Linear Is Best. ICALP 2022: 104:1-104:19 - [c7]Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena:
Circuits resilient to short-circuit errors. STOC 2022: 582-594 - [i16]Nicolas Resch, Chen Yuan:
Threshold Rates of Codes Ensembles: Linear is Best. CoRR abs/2205.01513 (2022) - [i15]Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich:
Smoothing Codes and Lattices: Systematic Study and New Bounds. CoRR abs/2205.10552 (2022) - [i14]Nicolas Resch, Chen Yuan, Yihan Zhang:
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. CoRR abs/2210.07754 (2022) - [i13]Klim Efremenko, Bernhard Haeupler, Yael Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh Saxena:
Circuits Resilient to Short-Circuit Errors. Electron. Colloquium Comput. Complex. TR22 (2022) - [i12]Klim Efremenko, Bernhard Haeupler, Gillat Kol, Nicolas Resch, Raghuvansh Saxena, Yael Tauman Kalai:
Interactive Coding with Small Memory. Electron. Colloquium Comput. Complex. TR22 (2022) - [i11]Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich:
Smoothing Codes and Lattices: Systematic Study and New Bounds. IACR Cryptol. ePrint Arch. 2022: 615 (2022) - [i10]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Correlated Pseudorandomness from Expand-Accumulate Codes. IACR Cryptol. ePrint Arch. 2022: 1014 (2022) - [i9]Thomas Debris-Alazard, Nicolas Resch:
Worst and Average Case Hardness of Decoding via Smoothing Bounds. IACR Cryptol. ePrint Arch. 2022: 1744 (2022) - 2021
- [j2]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs. Comb. 41(4): 545-579 (2021) - [j1]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. IEEE Trans. Inf. Theory 67(1): 296-316 (2021) - [c6]Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Sharp Threshold Rates for Random Codes. ITCS 2021: 5:1-5:20 - [i8]Nicolas Resch, Chen Yuan:
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. IACR Cryptol. ePrint Arch. 2021: 158 (2021) - 2020
- [c5]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for List-Decoding and List-Recovery of Random Linear Codes. APPROX-RANDOM 2020: 9:1-9:21 - [c4]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List Decoding Capacity. FOCS 2020: 458-469 - [i7]Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for list-decoding and list-recovery of random linear codes. CoRR abs/2004.13247 (2020) - [i6]Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Sharp threshold rates for random codes. CoRR abs/2009.04553 (2020)
2010 – 2019
- 2019
- [c3]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. APPROX-RANDOM 2019: 68:1-68:22 - [i5]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List Decoding Capacity. CoRR abs/1909.06430 (2019) - [i4]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. Electron. Colloquium Comput. Complex. TR19 (2019) - [i3]Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c2]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs. CCC 2018: 4:1-4:16 - [c1]Venkatesan Guruswami, Nicolas Resch:
On the List-Decodability of Random Linear Rank-Metric Codes. ISIT 2018: 1505-1509 - [i2]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless dimension expanders via linearized polynomials and subspace designs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i1]Venkatesan Guruswami, Nicolas Resch:
On the List-Decodability of Random Linear Rank-Metric Codes. CoRR abs/1710.11516 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-13 01:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
