Follow
Ravishankar Krishnaswamy
Ravishankar Krishnaswamy
Microsoft Research
Verified email at cs.cmu.edu - Homepage
Title
Cited by
Cited by
Year
The hardness of approximation of euclidean k-means
P Awasthi, M Charikar, R Krishnaswamy, AK Sinop
arXiv preprint arXiv:1502.03316, 2015
1822015
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
1302015
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
1252019
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
1022018
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
852011
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
822017
Online primal-dual for non-linear optimization with applications to speed scaling
A Gupta, R Krishnaswamy, K Pruhs
Approximation and Online Algorithms: 10th International Workshop, WAOA 2012 …, 2013
812013
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
702011
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
682015
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
652010
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
572012
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
562012
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
552012
Scalably scheduling power-heterogeneous processors
A Gupta, R Krishnaswamy, K Pruhs
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
552010
The non-uniform k-center problem
D Chakrabarty, P Goyal, R Krishnaswamy
arXiv preprint arXiv:1605.03692, 2016
492016
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
442010
Online and stochastic survivable network design
A Gupta, R Krishnaswamy, R Ravi
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
382009
Better scalable algorithms for broadcast scheduling
N Bansal, R Krishnaswamy, V Nagarajan
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
372010
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
362022
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
352015
The system can't perform the operation now. Try again later.
Articles 1–20