On the Complexity of Inner Product Similarity Join. - Thomas Dybdahl Ahle; Rasmus Pagh; Ilya P. Razenshteyn; Francesco Silvestri 001 (PODS, 2016)

High-dimensional Spherical Range Reporting by Output-Sensitive Multi-Probing LSH. - Thomas D. Ahle; Martin Aumüller 001; Rasmus Pagh (CoRR, 2016)

Optimal Las Vegas Locality Sensitive Data Structures. - Thomas Dybdahl Ahle (FOCS, 2017)

Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. - Thomas D. Ahle; Martin Aumüller 001; Rasmus Pagh (SODA, 2017)

Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search. - Thomas Dybdahl Ahle (CoRR, 2019)

Almost Optimal Tensor Sketch. - Thomas D. Ahle; Jakob Bæk Tejs Knudsen (CoRR, 2019)

Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search. - Thomas D. Ahle; Jakob Bæk Tejs Knudsen (FOCS, 2020)

On the Problem of p1-1 in Locality-Sensitive Hashing. - Thomas Dybdahl Ahle (SISAP, 2020)

Similarity Search with Tensor Core Units. - Thomas D. Ahle; Francesco Silvestri 001 (SISAP, 2020)

Oblivious Sketching of High-Degree Polynomial Kernels. - Thomas D. Ahle; Michael Kapralov; Jakob Bæk Tejs Knudsen; Rasmus Pagh; Ameya Velingker; David P. Woodruff; Amir Zandieh (SODA, 2020)

On the Problem of p1-1 in Locality-Sensitive Hashing. - Thomas Dybdahl Ahle (CoRR, 2020)

The Power of Hashing with Mersenne Primes. - Thomas Dybdahl Ahle; Jakob Bæk Tejs Knudsen; Mikkel Thorup (CoRR, 2020)

Clustering Embedding Tables, Without First Learning Them. - Henry Ling-Hei Tsang; Thomas Dybdahl Ahle (CoRR, 2022)

Clustering the Sketch: Dynamic Compression for Embedding Tables. - Henry Ling-Hei Tsang; Thomas D. Ahle (NeurIPS, 2023)

Favour: FAst Variance Operator for Uncertainty Rating. - Thomas D. Ahle; Sahar Karimi; Peter Tak Peter Tang (CoRR, 2023)

Tiling with Squares and Packing Dominos in Polynomial Time. - Anders Aamand; Mikkel Abrahamsen; Thomas D. Ahle; Peter M. R. Rasmussen (ACM Trans. Algorithms, 2023)