17 citations · 24 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Makespan Scheduling of Unit Jobs with Precedence Constraints in time
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Węgrzycki
In a classical scheduling problem, we are given a set of jobs of unit length along with precedence constraints and the goal is to find a schedule of these jobs on identical…
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 …