University Researcher
Thijs Laarhoven
Department / Institute
RESEARCH PROFILE
After completing his study Applied Mathematics at the TU/e in 2011, Thijs Laarhoven started his doctoral research on the topic of cryptography and algorithms, also at the TU/e. In February 2016 he obtained his PhD (with honors) on this subject, under the supervision and guidance of prof. Tanja Lange and dr. Benne de Weger.
After finishing his PhD, he went to Switzerland to continue his research at the IBM Research laboratory near Zurich for 1.5 years. Since November 2017 he is now back at the TU/e in prof. Nikhil Bansal's group.
The best scientific research stems from curiosity.
Key Publications
-
Alexandr Andoni,Piotr Indyk,T.M.M. Laarhoven,Ilya Razenshteyn,Ludwig Schmidt
Practical and optimal LSH for angular distance
(2015) -
Thijs Laarhoven
Sieving for shortest vectors in lattices using angular locality-sensitive hashing
(2015) -
Anja Becker,Leo Ducas,Nicolas Gama,Thijs Laarhoven
New directions in nearest neighbor searching with applications to lattice sieving
(2016) -
Alexandr Andoni,Thijs Laarhoven,Ilya Razenshteyn,Erik Waingarten
Optimal hashing-based time-space trade-offs for approximate near neighbors
(2017) -
T.M.M. Laarhoven,Michele Mosca,Joop Pol, van de
Finding shortest lattice vectors faster using quantum search
Designs, Codes and Cryptography (2015)
Ancillary Activities
No ancillary activities