| 2021 | CRYPTO | Lower Bounds on Lattice Sieving and Information Set Decoding. | Elena Kirshanova, Thijs Laarhoven |
| 2020 | ICALP | Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem. | Thijs Laarhoven |
| 2020 | PKC | The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier. | Lo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden |
| 2019 | IJCCI | Evolutionary Techniques in Lattice Sieving Algorithms. | Thijs Laarhoven |
| 2019 | PQCrypto | Round5: Compact and Fast Post-quantum Public-Key Encryption. | Hayo Baan, Sauvik Bhattacharya, Scott R. Fluhrer, scar Garca-Morchn, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang |
| 2019 | PQCrypto | Finding Closest Lattice Vectors Using Approximate Voronoi Cells. | Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger |
| 2018 | PKC | Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving. | Gottfried Herold, Elena Kirshanova, Thijs Laarhoven |
| 2018 | PQCrypto | Progressive Lattice Sieving. | Thijs Laarhoven, Artur Mariano |
| 2017 | MFCS | Hypercube LSH for Approximate near Neighbors. | Thijs Laarhoven |
| 2017 | PDP | A Parallel Variant of LDSieve for the SVP on Lattices. | Artur Mariano, Thijs Laarhoven, Christian H. Bischof |
| 2017 | SODA | Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. | Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten |
| 2016 | SODA | New directions in nearest neighbor searching with applications to lattice sieving. | Anja Becker, Lo Ducas, Nicolas Gama, Thijs Laarhoven |
| 2015 | CRYPTO | Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing. | Thijs Laarhoven |
| 2015 | ICPP | Parallel (Probable) Lock-Free Hash Sieve: A Practical Sieving Algorithm for the SVP. | Artur Mariano, Christian H. Bischof, Thijs Laarhoven |
| 2013 | PQCrypto | Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. | Thijs Laarhoven, Michele Mosca, Joop van de Pol |