activity
20152026
most citedOn the Complexity of Inner Product Similarity Join

27 citations · 57 across the 10 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.DS2019

Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search

Thomas Dybdahl Ahle, Jakob Bæk Tejs Knudsen

We formulate and optimally solve a new generalized Set Similarity Search problem, which assumes the size of the database and query sets are known in advance. By creating polylog co…