Thijs Laarhoven

Eindhoven University of Technology


Hi, and welcome to my website! I am Thijs Laarhoven, and currently I am a postdoctoral researcher at the Eindhoven University of Technology in the Netherlands, in Nikhil Bansal's group. Previously I was a postdoc at IBM Research in Zurich, Switzerland, working on lattice-based cryptography in the group of Vadim Lyubashevsky. Before that I obtained my BSc, MSc, and PhD degrees at the Eindhoven University of Technology, under the inspired supervision of Benne de Weger.

Veni grant

Recently I was awarded an NWO Veni grant (EUR 250.000) for my research proposal on lattices and nearest neighbor searching. This will allow me to continue my research on this topic for the next three years (2019-2021). Out of 1115 total applications (275 of which in the Science domain), only 154 were awarded (45 in the Science domain). See also the NWO press release, the TU/e-wide press release, and the TU/e M&CS press release for more information.


To contact me, please e-mail me at Please do not e-mail me at my university e-mail address, as your message might be marked as spam and I may not read your e-mail.

In case you need to reach me at the university, my office is MetaForum 4.096, which is on the fourth floor of MetaForum, in the eastern outer ring. To make sure you will actually find me there when you're stopping by, please e-mail me beforehand to schedule an appointment. For more information on finding my office on the university campus, see the map of the TU/e.

Selected publications

Below are some selected (recent) publications related to my research. A complete list of publications, with slides and code (if available), can be found under "Publications" above.

  • Optimal hashing-based time-space trade-offs for approximate near neighbors
    pdf link

    Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, Erik Waingarten
    SODA 2017
  • New directions in nearest neighbor searching with applications to lattice sieving
    slides pdf link code

    Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven
    SODA 2016
  • Finding shortest lattice vectors faster using quantum search
    pdf link

    Thijs Laarhoven, Michele Mosca, Joop van de Pol
    Designs, Codes and Cryptography 2015
  • Practical and optimal LSH for angular distance
    pdf link code

    Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, Ludwig Schmidt
    NIPS 2015
  • Sieving for shortest vectors in lattices using angular locality-sensitive hashing
    slides pdf link code

    Thijs Laarhoven
    CRYPTO 2015