Tal Wagner

activity

20152026

most citedScalable Fair Clustering

58 citations · 82 across the 17 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DS2018

Multitasking Capacity: Hardness Results and Improved Constructions

Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths +5

We consider the problem of determining the maximal $α \in (0, 1]$ such that every matching $M$ of size $k$ (or at most $k$ ) in a bipartite graph $G$ contains an induced matching of s…

cs.DS2018

Approximate Nearest Neighbors in Limited Space

Piotr Indyk, Tal Wagner

We consider the $(1 + ε)$ -approximate nearest neighbor search problem: given a set $X$ of $n$ points in a $d$ -dimensional space, build a data structure that, given any query point $y…