33 citations · 104 across the 16 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 7 cited
Locality-Sensitive Hashing without False Negatives for l_p
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki +1
In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius …
cs.DS2016★ 6 cited
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Piotr Sankowski, Karol Węgrzycki
Consider an unweighted, directed graph with the diameter . In this paper, we introduce the framework for counting cycles and walks of given length in matrix multiplication t…