| Provable bounds for learning some deep representations S Arora, A Bhaskara, R Ge, T Ma International conference on machine learning, 584-592, 2014 | 454 | 2014 |
| Detecting high log-densities: an O(n¼) approximation for densest k-subgraph A Bhaskara, M Charikar, E Chlamtac, U Feige, A Vijayaraghavan Proceedings of the forty-second ACM symposium on Theory of computing, 201-210, 2010 | 407 | 2010 |
| Smoothed analysis of tensor decompositions A Bhaskara, M Charikar, A Moitra, A Vijayaraghavan Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 172 | 2014 |
| Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph A Bhaskara, M Charikar, V Guruswami, A Vijayaraghavan, Y Zhou Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 137 | 2012 |
| Fair clustering via equitable group representations M Abbasi, A Bhaskara, S Venkatasubramanian Proceedings of the 2021 ACM conference on fairness, accountability, and …, 2021 | 106 | 2021 |
| Centrality of trees for capacitated -center HC An, A Bhaskara, C Chekuri, S Gupta, V Madan, O Svensson Mathematical Programming 154 (1), 29-53, 2015 | 97 | 2015 |
| Distributed balanced clustering via mapping coresets MH Bateni, A Bhaskara, S Lattanzi, V Mirrokni Advances in Neural Information Processing Systems 27, 2014 | 90 | 2014 |
| Greedy column subset selection: New bounds and distributed algorithms J Altschuler, A Bhaskara, G Fu, V Mirrokni, A Rostamizadeh, ... International conference on machine learning, 2539-2548, 2016 | 80 | 2016 |
| Uniqueness of tensor decompositions with applications to polynomial identifiability A Bhaskara, M Charikar, A Vijayaraghavan Conference on Learning Theory, 742-778, 2014 | 75 | 2014 |
| Online learning with imperfect hints A Bhaskara, A Cutkosky, R Kumar, M Purohit International Conference on Machine Learning, 822-831, 2020 | 64 | 2020 |
| More algorithms for provable dictionary learning S Arora, A Bhaskara, R Ge, T Ma arXiv preprint arXiv:1401.0579, 2014 | 62 | 2014 |
| Unconditional differentially private mechanisms for linear queries A Bhaskara, D Dadush, R Krishnaswamy, K Talwar Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 61 | 2012 |
| Approximating Matrix p-norms A Bhaskara, A Vijayaraghavan Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 61 | 2011 |
| On binary embedding using circulant matrices XY Felix, A Bhaskara, S Kumar, Y Gong, SF Chang Journal of Machine Learning Research 18 (150), 1-30, 2018 | 35 | 2018 |
| Optimizing display advertising in online social networks Z Abbassi, A Bhaskara, V Misra Proceedings of the 24th International Conference on World Wide Web, 1-11, 2015 | 34 | 2015 |
| Greedy sampling for approximate clustering in the presence of outliers A Bhaskara, S Vadgama, H Xu Advances in Neural Information Processing Systems 32, 2019 | 30 | 2019 |
| Linear relaxations for finding diverse elements in metric spaces A Bhaskara, M Ghadiri, V Mirrokni, O Svensson Advances in neural information processing systems 29, 2016 | 28 | 2016 |
| Distributed clustering via lsh based data partitioning A Bhaskara, M Wijewardena International Conference on Machine Learning, 570-579, 2018 | 27 | 2018 |
| Going beyond classification accuracy metrics in model compression V Joseph, SA Siddiqui, A Bhaskara, G Gopalakrishnan, S Muralidharan, ... arXiv preprint arXiv:2012.01604, 2020 | 20* | 2020 |
| Minimum makespan scheduling with low rank processing times A Bhaskara, R Krishnaswamy, K Talwar, U Wieder Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 20 | 2013 |
