33 citations · 81 across the 24 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019★ 3 cited
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan +1
``Composable core-sets'' are an efficient framework for solving optimization problems in massive data models. In this work, we consider efficient construction of composable core-se…
cs.LG2019★ 4 cited
Near Neighbor: Who is the Fairest of Them All?
Sariel Har-Peled, Sepideh Mahabadi
In this work we study a fair variant of the near neighbor problem. Namely, given a set o…
cs.DS2019★ 3 cited
Set Cover in Sub-linear Time
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld +2
We study the classic set cover problem from the perspective of sub-linear algorithms. Given access to a collection of sets over elements in the query model, we show that su…