Thomas Dybdahl Ahle

Home * People * Thomas Dybdahl Ahle

Thomas Dybdahl Ahle [1] Thomas Dybdahl Ahle,

a Danish computer scientist, software developer, and currently post doctoral researcher at Basic Algorithms Research group (BARC) [2] at University of Copenhagen [3]. He holds a Master of Arts in computer science in 2013 from University of Oxford, and a M.Sc. and Ph.D. in algorithms and theoretical computer science from University of Copenhagen in 2017 and 2019 respectively.

Selected Publications

Thomas Dybdahl Ahle, Rasmus Pagh, Ilya Razenshteyn, Francesco Silvestri (2015). On the Complexity of Inner Product Similarity Join. arXiv:1510.02824
Thomas Dybdahl Ahle, Martin Aumüller, Rasmus Pagh (2016). Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. arXiv:1605.02673 [8]
Thomas Dybdahl Ahle (2017). Optimal Las Vegas Locality Sensitive Data Structures. arXiv:1704.02054
Thomas Dybdahl Ahle (2017). Optimal Set Similarity Data-structures Without False Negatives. Master thesis, University of Copenhagen, pdf [9]
Thomas Dybdahl Ahle (2019). Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search. arXiv:1904.04045
Thomas Dybdahl Ahle (2019). Algorithms for Sets. Ph.D. thesis, University of Copenhagen
Thomas Dybdahl Ahle, Michael Kapralov, Jakob Tejs Bæk Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh (2019). Oblivious Sketching of High-Degree Polynomial Kernels. pdf

Thomas Dybdahl Ahle, Jakob Tejs Bæk Knudsen, Mikkel Thorup (2020). The Power of Hashing with Mersenne Primes. arXiv:2008.08654 [10]