2 citations · 4 across the 10 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Edge Sampling and Graph Parameter Estimation via Vertex Neighborhood Accesses
Jakub Tětek, Mikkel Thorup
In this paper, we consider the problems from the area of sublinear-time algorithms of edge sampling, edge counting, and triangle counting. Part of our contribution is that we consi…
cs.DS2021★ 2 cited
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication
Jakub Tětek
There is a trivial time algorithm for approximate triangle counting where is the number of triangles in the graph and the number of vertices. At the same…
cs.DS2021
CountSketches, Feature Hashing and the Median of Three
Kasper Green Larsen, Rasmus Pagh, Jakub Tětek
In this paper, we revisit the classic CountSketch method, which is a sparse, random projection that transforms a (high-dimensional) Euclidean vector to a vector of dimension $(…