| Diskann: Fast accurate billion-point nearest neighbor search on a single node S Jayaram Subramanya, F Devvrit, HV Simhadri, R Krishnawamy, ... Advances in Neural Information Processing Systems 32, 2019 | 231 | 2019 |
| The hardness of approximation of euclidean k-means P Awasthi, M Charikar, R Krishnaswamy, AK Sinop arXiv preprint arXiv:1502.03316, 2015 | 203 | 2015 |
| Relax, no need to round: Integrality of clustering formulations P Awasthi, AS Bandeira, M Charikar, R Krishnaswamy, S Villar, R Ward Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 136 | 2015 |
| Constant approximation for k-median and k-means with outliers via iterative rounding R Krishnaswamy, S Li, S Sandeep Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018 | 127 | 2018 |
| Online and dynamic algorithms for set cover A Gupta, R Krishnaswamy, A Kumar, D Panigrahi Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 95 | 2017 |
| Approximation algorithms for correlated knapsacks and non-martingale bandits A Gupta, R Krishnaswamy, M Molinaro, R Ravi 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 827-836, 2011 | 93 | 2011 |
| Online primal-dual for non-linear optimization with applications to speed scaling A Gupta, R Krishnaswamy, K Pruhs International Workshop on Approximation and Online Algorithms, 173-186, 2012 | 89 | 2012 |
| The matroid median problem R Krishnaswamy, A Kumar, V Nagarajan, Y Sabharwal, B Saha Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 79 | 2011 |
| A 2-competitive algorithm for online convex optimization with switching costs N Bansal, A Gupta, R Krishnaswamy, K Pruhs, K Schewior, C Stein Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015 | 77 | 2015 |
| A constant factor approximation algorithm for generalized min-sum set cover N Bansal, A Gupta, R Krishnaswamy Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 66 | 2010 |
| 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 | 63 | 2012 |
| Scheduling heterogeneous processors isn't as easy as you think A Gupta, S Im, R Krishnaswamy, B Moseley, K Pruhs Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 61 | 2012 |
| Results of the NeurIPS’21 challenge on billion-scale approximate nearest neighbor search HV Simhadri, G Williams, M Aumüller, M Douze, A Babenko, D Baranchuk, ... NeurIPS 2021 Competitions and Demonstrations Track, 177-189, 2022 | 59 | 2022 |
| The non-uniform k-center problem D Chakrabarty, P Goyal, R Krishnaswamy arXiv preprint arXiv:1605.03692, 2016 | 57 | 2016 |
| Approximation algorithms for stochastic orienteering A Gupta, R Krishnaswamy, V Nagarajan, R Ravi Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 57 | 2012 |
| Scalably scheduling power-heterogeneous processors A Gupta, R Krishnaswamy, K Pruhs Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010 | 57 | 2010 |
| Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters S Gollapudi, N Karia, V Sivashankar, R Krishnaswamy, N Begwani, S Raz, ... Proceedings of the ACM Web Conference 2023, 3406-3416, 2023 | 42 | 2023 |
| The Non-Uniform k-Center Problem D Chakrabarty, P Goyal, R Krishnaswamy ACM Transactions on Algorithms (TALG) 16 (4), 1-19, 2020 | 42 | 2020 |
| Running errands in time: Approximation algorithms for stochastic orienteering A Gupta, R Krishnaswamy, V Nagarajan, R Ravi Mathematics of Operations Research 40 (1), 56-79, 2015 | 42 | 2015 |
| Network-wide deployment of intrusion detection and prevention systems V Sekar, R Krishnaswamy, A Gupta, MK Reiter Proceedings of the 6th International COnference, 1-12, 2010 | 42 | 2010 |
