default search action
Thomas D. Ahle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j1]Anders Aamand
, Mikkel Abrahamsen
Tiling with Squares and Packing Dominos in Polynomial Time. ACM Trans. Algorithms 19(3): 30:1-30:28 (2023) - [c9]Henry Ling-Hei Tsang, Thomas D. Ahle:
Clustering the Sketch: Dynamic Compression for Embedding Tables. NeurIPS 2023 - [i11]Thomas D. Ahle, Sahar Karimi, Peter Tak Peter Tang:
Favour: FAst Variance Operator for Uncertainty Rating. CoRR abs/2311.13036 (2023) - 2022
- [c8]Anders Aamand, Mikkel Abrahamsen
Tiling with Squares and Packing Dominos in Polynomial Time. SoCG 2022: 1:1-1:17 - [i10]Henry Ling-Hei Tsang, Thomas Dybdahl Ahle:
Clustering Embedding Tables, Without First Learning Them. CoRR abs/2210.05974 (2022) - 2020
- [c7]Thomas D. Ahle, Jakob Bæk Tejs Knudsen:
Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search. FOCS 2020: 728-739 - [c6]Thomas D. Ahle
Similarity Search with Tensor Core Units. SISAP 2020: 76-84 - [c5]Thomas Dybdahl Ahle
On the Problem of p1-1 in Locality-Sensitive Hashing. SISAP 2020: 85-93 - [c4]Thomas D. Ahle, Michael Kapralov
Oblivious Sketching of High-Degree Polynomial Kernels. SODA 2020: 141-160 - [i9]Thomas Dybdahl Ahle:
On the Problem of p1-1 in Locality-Sensitive Hashing. CoRR abs/2005.12065 (2020) - [i8]Thomas D. Ahle, Francesco Silvestri:
Similarity Search with Tensor Core Units. CoRR abs/2006.12608 (2020) - [i7]Thomas Dybdahl Ahle, Jakob Bæk Tejs Knudsen, Mikkel Thorup:
The Power of Hashing with Mersenne Primes. CoRR abs/2008.08654 (2020) - [i6]Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. CoRR abs/2011.10983 (2020)
2010 – 2019
- 2019
- [i5]Thomas Dybdahl Ahle:
Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search. CoRR abs/1904.04045 (2019) - [i4]Thomas D. Ahle, Jakob Bæk Tejs Knudsen:
Almost Optimal Tensor Sketch. CoRR abs/1909.01821 (2019) - 2017
- [c3]Thomas Dybdahl Ahle:
Optimal Las Vegas Locality Sensitive Data Structures. FOCS 2017: 938-949 - [c2]Thomas D. Ahle, Martin Aumüller, Rasmus Pagh:
Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. SODA 2017: 239-256 - [i3]Thomas Dybdahl Ahle:
Optimal Las Vegas Locality Sensitive Data Structures. CoRR abs/1704.02054 (2017) - 2016
- [c1]Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
On the Complexity of Inner Product Similarity Join. PODS 2016: 151-164 - [i2]Thomas D. Ahle, Martin Aumüller, Rasmus Pagh:
High-dimensional Spherical Range Reporting by Output-Sensitive Multi-Probing LSH. CoRR abs/1605.02673 (2016) - 2015
- [i1]Thomas D. Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri:
On the Complexity of Inner Product Similarity Join. CoRR abs/1510.02824 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: