1. Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
2. Parallel Graph Connectivity in Log Diameter Rounds
3. David Arthur and Sergei Vassilvitskii . 2007 . k-means++: The advantages of careful seeding . In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 1027--1035 . David Arthur and Sergei Vassilvitskii. 2007. k-means++: The advantages of careful seeding. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 1027--1035.
4. Maria-Florina Balcan Travis Dick Yingyu Liang Wenlong Mou and Hongyang Zhang. 2017. Code of the algorithm described in Differentially Private Clustering in High-Dimensional Euclidean Spaces. https://github.com/mouwenlong/dpclustering-icml17 Maria-Florina Balcan Travis Dick Yingyu Liang Wenlong Mou and Hongyang Zhang. 2017. Code of the algorithm described in Differentially Private Clustering in High-Dimensional Euclidean Spaces. https://github.com/mouwenlong/dpclustering-icml17
5. Maria-Florina Balcan , Travis Dick , Yingyu Liang , Wenlong Mou , and Hongyang Zhang . 2017 . Differentially Private Clustering in High-Dimensional Euclidean Spaces . In Proceedings of the 34th International Conference on Machine Learning, ICML (Proceedings of Machine Learning Research , Vol. 70), Doina Precup and Yee Whye Teh (Eds.). PMLR, 322-- 331 . Maria-Florina Balcan, Travis Dick, Yingyu Liang, Wenlong Mou, and Hongyang Zhang. 2017. Differentially Private Clustering in High-Dimensional Euclidean Spaces. In Proceedings of the 34th International Conference on Machine Learning, ICML (Proceedings of Machine Learning Research, Vol. 70), Doina Precup and Yee Whye Teh (Eds.). PMLR, 322--331.