Thijs Laarhoven is a postdoctoral researcher at the Eindhoven University of Technology in the Netherlands. Previously, he was a postdoc at IBM Research in Zurich, Switzerland, and before that - a PhD student at the Eindhoven University of Technology. His research topics include collusion-resistant fingerprinting and group testing algorithms, lattice algorithms for solving hard lattice problems (and the relation to lattice-based cryptography), nearest-neighbor search techniques like locality-sensitive hashing (LSH) and his new method locality-sensitive filtering (LSF), and exotic topics like the Collatz conjecture. Thijs obtained the degrees of Bachelor of Science (2009) and Master of Science (2011) from the Eindhoven University of Technology, graduating with honors in Industrial and Applied Mathematics.
- Lattices: Algorithms, Complexity, and Cryptography, Spring 2020. Visiting Scientist.