Thomas D. Ahle
TitleCited byYear
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
302016
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
232017
Optimal las vegas locality sensitive data structures
TD Ahle
Proceedings of the 58th IEEE Symposium on Foundations of Computer Science (FOCS), 2017
192017
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
22020
Almost optimal tensor sketch
TD Ahle, JBT Knudsen
arXiv preprint arXiv:1909.01821, 2019
22019
Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search
TD Ahle
arXiv preprint arXiv:1904.04045, 2019
2019
Similarity Search: Algorithms for Sets and other High Dimensional Data
TD Ahle
2019
Asymptotic Tail Bound and Applications
TD Ahle
2017
Optimal Set Similarity Data-structures Without False Negatives
TD Ahle
2017
The system can't perform the operation now. Try again later.
Articles 1–9