| NP-hardness of Euclidean sum-of-squares clustering D Aloise, A Deshpande, P Hansen, P Popat Machine learning 75, 245-248, 2009 | 1204 | 2009 |
| Matrix approximation and projective clustering via volume sampling A Deshpande, L Rademacher, SS Vempala, G Wang Theory of Computing 2 (1), 225-247, 2006 | 365 | 2006 |
| Adaptive sampling and fast low-rank matrix approximation A Deshpande, S Vempala Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006 | 234 | 2006 |
| Efficient volume sampling for row/column subset selection A Deshpande, L Rademacher 2010 ieee 51st annual symposium on foundations of computer science, 329-338, 2010 | 219 | 2010 |
| Adaptive Sampling for k-Means Clustering A Aggarwal, A Deshpande, R Kannan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 144 | 2009 |
| Fair and diverse DPP-based data summarization E Celis, V Keswani, D Straszak, A Deshpande, T Kathuria, N Vishnoi International Conference on Machine Learning, 716-725, 2018 | 96 | 2018 |
| Batched gaussian process bandit optimization via determinantal point processes T Kathuria, A Deshpande, P Kohli Advances in neural information processing systems 29, 2016 | 92 | 2016 |
| How to be fair and diverse? LE Celis, A Deshpande, T Kathuria, NK Vishnoi arXiv preprint arXiv:1610.07183, 2016 | 74 | 2016 |
| On greedy maximization of entropy D Sharma, A Kapoor, A Deshpande International Conference on Machine Learning, 1330-1338, 2015 | 59 | 2015 |
| Sampling-based dimension reduction for subspace approximation A Deshpande, K Varadarajan Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 54 | 2007 |
| Better lower bounds for locally decodable codes A Deshpande, R Jain, T Kavitha, SV Lokam, J Radhakrishnan Proceedings 17th IEEE Annual Conference on Computational Complexity, 184-193, 2002 | 49 | 2002 |
| Algorithms and hardness for subspace approximation A Deshpande, M Tulsiani, NK Vishnoi Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 43 | 2011 |
| Improved smoothed analysis of the shadow vertex simplex method A Deshpande, DA Spielman 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 349-356, 2005 | 30 | 2005 |
| On the complexity of constrained determinantal point processes LE Celis, A Deshpande, T Kathuria, D Straszak, NK Vishnoi arXiv preprint arXiv:1608.00554, 2016 | 25 | 2016 |
| How Linguistically Fair Are Multilingual Pre-Trained Language Models? M Choudhury, A Deshpande Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12710 …, 2021 | 20 | 2021 |
| The importance of modeling data missingness in algorithmic fairness: A causal perspective N Goel, A Amayuelas, A Deshpande, A Sharma Proceedings of the AAAI Conference on Artificial Intelligence 35 (9), 7564-7573, 2021 | 19 | 2021 |
| Robust -means++ A Deshpande, P Kacham, R Pratap Conference on Uncertainty in Artificial Intelligence, 799-808, 2020 | 15 | 2020 |
| Partitioning a planar graph of girth ten into a forest and a matching A Bassa, J Burns, J Campbell, A Deshpande, J Farley, M Halsey, ... manuscript, 2004 | 14 | 2004 |
| On sampling and greedy map inference of constrained determinantal point processes T Kathuria, A Deshpande arXiv preprint arXiv:1607.01551, 2016 | 13 | 2016 |
| Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. K Chandrasekaran, A Deshpande, SS Vempala APPROX-RANDOM, 420-433, 2009 | 12 | 2009 |
