65 citations · 108 across the 25 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
Cubic Goldreich-Levin
Dain Kim, Anqi Li, Jonathan Tidor
In this paper, we give a cubic Goldreich-Levin algorithm which makes polynomially-many queries to a function and produces a decomposition of…
cs.DS2020
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost
Aaron Berger, William Kuszmaul, Adam Polak +2
We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of workers and a multiset of tasks,…
cs.DS2018
Spectral methods for testing cluster structure of graphs
Sandeep Silwal, Jonathan Tidor
In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is -clusterable if it can be part…