Scalable fair clustering
- Arturs Backurs
- Piotr Indyk
- et al.
- 2019
- ICML 2019
Publications
4 results for Arturs Backurs
If the current Clique algorithms are optimal, so is Valiant's parser
- Amir Abboud
- Arturs Backurs
- et al.
- 2018
- SIAM Journal on Computing
Fast algorithms for parsing sequences of parentheses with few errors
- Arturs Backurs
- Krzysztof Onak
- 2016
- SIGMOD/PODS 2016
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
- Arturs Backurs
- Piotr Indyk
- et al.
- 2016
- SODA 2016