Meet ApplyKite Twin, the application assistant that learns with you

Meet your Twin, it learns with you

Your Twin learns with you

Launch week codes:30% off annual Pro20% off monthly Pro

Ends in00h00m00s

Nicolas Resch

Academic, Assistant Professor

University of Amsterdam

Netherlands

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Professors in Netherlands

Articles (18)

Year:

2026

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Collaborators (5)

Thomas Attema

TNO

NETHERLANDS

View details

Jonathan Mosheiff

Ben-Gurion University of the Negev

ISRAEL

View details

Bernhard Haeupler

Faculty & Group Leader "Theory and Algorithms"

sofia university “st. kliment ohridski”

BULGARIA

View details

Peter Scholl

VIP, Associate Professor

Aarhus University

DENMARK

View details

Joao Lourenco Ribeiro

Researcher

Instituto de Telecomunicações

PORTUGAL

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Nicolas Resch

Research Interests

Make your next move.

Explore related searches

Articles (18)

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes

Linear Time Encodable Binary Code Achieving GV Bound With Linear Time Encodable Dual Achieving GV Bound

The Fiat—Shamir Transformation of $$(\varGamma _1,\dots ,\varGamma _\mu )$$-Special-Sound Interactive Proofs

List-Recovery of Random Linear Codes Over Small Fields

On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography

List Recoverable Codes: The Good, the Bad, and the Unknown (Hopefully Not Ugly)

Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes

Blaze: Fast SNARKs from Interleaved RAA Codes

Worst and Average Case Hardness of Decoding via Smoothing Bounds

Circuits Resilient to Short-Circuit Errors

Threshold Rates of Code Ensembles

Low-Density Parity-Check Codes Achieve List-Decoding Capacity

Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery

Oblivious Transfer with Constant Computational Overhead

Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate

Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness

Interactive Coding with Small Memory

Smoothing Codes and Lattices: Systematic Study and New Bounds

Collaborators (5)

Thomas Attema

Jonathan Mosheiff

Bernhard Haeupler

Peter Scholl

Joao Lourenco Ribeiro

Make your next move.