Thomas D. Ahle

Cited by

	All	Since 2017
Citations	191	188
h-index	6	6
i10-index	4	4

20162017201820192020202120222 22 22 27 36 46 27

Public access

View all

6 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Rasmus PaghProfessor of computer science, University of CopenhagenVerified email at di.ku.dk
Francesco SilvestriAssociate professor, University of PadovaVerified email at dei.unipd.it
Ilya RazenshteynMicrosoft ResearchVerified email at mit.edu
Martin AumüllerIT University of CopenhagenVerified email at itu.dk
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Amir ZandiehMax Planck Institute - InformaticsVerified email at mpi-inf.mpg.de
Ameya Velingker | अमेय वेलिंगकरResearch Scientist, Google ResearchVerified email at google.com
Michael KapralovAssistant Professor, EPFLVerified email at epfl.ch
Mikkel ThorupUniversity of CopenhagenVerified email at diku.dk
Peter Michael Reichstein RasmussenUniversity of CopenhagenVerified email at alumni.ku.dk
Mikkel AbrahamsenAssistant Professor of Computer Science, University of CopenhagenVerified email at di.ku.dk
Anders AamandUniversity of Copenhagen, Department of Computer Science, BARCVerified email at di.ku.dk
Jakob Bæk Tejs HouenUniversity of CopenhagenVerified email at di.ku.dk

Thomas D. Ahle

Meta Research, IT University of Copenhagen, BARC

Verified email at fb.com - Homepage

Randomized Algorithms Hashing Similarity Search Sketching


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Oblivious sketching of high-degree polynomial kernels TD Ahle, M Kapralov, JBT Knudsen, R Pagh, A Velingker, DP Woodruff, ... Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020	55	2020
On the complexity of inner product similarity join TD Ahle, R Pagh, I Razenshteyn, F Silvestri Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016	43	2016
Parameter-free locality sensitive hashing for spherical range reporting TD Ahle, M Aumüller, R Pagh Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	37	2017
Optimal las vegas locality sensitive data structures TD Ahle Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS), 2017	29	2017
Sharp and Simple Bounds for the raw Moments of the Binomial and Poisson Distributions TD Ahle Statistics & Probability Letters 182, 2022	7	2022
Almost optimal tensor sketch TD Ahle, JBT Knudsen arXiv preprint arXiv:1909.01821, 2019	7	2019
Similarity search with tensor core units T D Ahle, F Silvestri International Conference on Similarity Search and Applications, 76-84, 2020	4	2020
On the Problem of in Locality-Sensitive Hashing TD Ahle International Conference on Similarity Search and Applications, 85-93, 2020	2	2020
Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search TD Ahle, JBT Knudsen 61st IEEE Symposium on Foundations of Computer Science (FOCS) 1, 728-739, 2020	2	2020
Asymptotic Tail Bound and Applications TD Ahle	2	2017
It is NP-hard to verify an LSF on the sphere T Ahle Unpublished manuscript, 2017	2	2017
Similarity Search: Algorithms for Sets and other High Dimensional Data TD Ahle IT University of Copenhagen, 2019	1	2019
Tiling with Squares and Packing Dominos in Polynomial Time A Aamand, M Abrahamsen, TD Ahle, PMR Rasmussen arXiv preprint arXiv:2011.10983, 2020		2020
The Power of Hashing with Mersenne Primes TD Ahle, JTB Knudsen, M Thorup arXiv preprint arXiv:2008.08654, 2020		2020
Optimal Set Similarity Data-structures Without False Negatives TD Ahle		2017

The system can't perform the operation now. Try again later.

Articles 1–15

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors