18 citations · 31 across the 3 of their papers we have counts for
3 papers
cs.DS2014★ 1 cited
Consistent Subset Sampling
Konstantin Kutzkov, Rasmus Pagh
Consistent sampling is a technique for specifying, in small space, a subset of a potentially large universe such that the elements in satisfy a suitably chosen sampling…
cs.DS2014★ 18 cited
Triangle counting in dynamic graph streams
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov +1
Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been st…
cs.DS2010★ 12 cited
Using CSP To Improve Deterministic 3-SAT
Konstantin Kutzkov, Dominik Scheder
We show how one can use certain deterministic algorithms for higher-value constraint satisfaction problems (CSPs) to speed up deterministic local search for 3-SAT. This way, we imp…