Ravishankar Krishnaswamy

According to our database, Ravishankar Krishnaswamy authored at least 53 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing.

Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein

SIAM J. Comput., 2024

2023

Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters.

Siddharth Gollapudi, Neel Karia, Varun Sivashankar, Ravishankar Krishnaswamy, Nikit Begwani, Swapnil Raz, Yiyong Lin, Yin Zhang, Neelam Mahapatro, Premkumar Srinivasan, Amit Singh, Harsha Vardhan Simhadri

Proceedings of the ACM Web Conference 2023, 2023

Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse.

Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments.

Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries.

Shikhar Jaiswal, Ravishankar Krishnaswamy, Ankit Garg, Harsha Vardhan Simhadri, Sheshansh Agrawal

CoRR, 2022

Online Discrepancy with Recourse for Vectors and Graphs.

Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search.

Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy, Harsha Vardhan Simhadri

CoRR, 2021

Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search.

Harsha Vardhan Simhadri, George Williams, Martin Aumüller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krishnaswamy, Gopal Srinivasa, Suhas Jayaram Subramanya, Jingdong Wang

Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, 2021

2020

The Non-Uniform <i>k</i>-Center Problem.

Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy

ACM Trans. Algorithms, 2020

Hallucination Helps: Energy Efficient Virtual Circuit Routing.

Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein

SIAM J. Comput., 2020

Online Carpooling Using Expander Decompositions.

Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Permutation Strikes Back: The Power of Recourse in Online Metric Matching.

Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep

Proceedings of the Approximation, 2020

2019

Elastic Caching.

Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Rand-NSG: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node.

Suhas Jayaram Subramanya, Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnaswamy, Rohan Kadekodi

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Robust Correlation Clustering.

Devvrit, Ravishankar Krishnaswamy, Nived Rajaraman

Proceedings of the Approximation, 2019

2018

Online Buy-at-Bulk Network Design.

Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi

SIAM J. Comput., 2018

Constant approximation for k-median and k-means with outliers via iterative rounding.

Ravishankar Krishnaswamy, Shi Li, Sai Sandeep

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Online and dynamic algorithms for set cover.

Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Learning Mixture of Gaussians with Streaming Data.

Aditi Raghunathan, Prateek Jain, Ravishankar Krishnaswamy

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

The Heterogeneous Capacitated k-Center Problem.

Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Broadcast Scheduling - Minimizing Average Response Time.

Ravishankar Krishnaswamy

Encyclopedia of Algorithms, 2016

Inapproximability of the Multilevel Uncapacitated Facility Location Problem.

Ravishankar Krishnaswamy, Maxim Sviridenko

ACM Trans. Algorithms, 2016

Spectral Embedding of k-Cliques, Graph Partitioning and k-Means.

Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

The Non-Uniform k-Center Problem.

Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Facility Location with Matroid or Knapsack Constraints.

Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha

Math. Oper. Res., 2015

Running Errands in Time: Approximation Algorithms for Stochastic Orienteering.

Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi

Math. Oper. Res., 2015

Relax, No Need to Round: Integrality of Clustering Formulations.

Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel A. Ward

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

The Hardness of Approximation of Euclidean k-Means.

Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop

Proceedings of the 31st International Symposium on Computational Geometry, 2015

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs.

Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein

Proceedings of the Approximation, 2015

2014

Better Scalable Algorithms for Broadcast Scheduling.

Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan

ACM Trans. Algorithms, 2014

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing.

Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein

Proceedings of the Symposium on Theory of Computing, 2014

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach.

Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Minimum Makespan Scheduling with Low Rank Processing Times.

Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Capacitated Network Design on Undirected Graphs.

Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Approximation Techniques for Stochastic Combinatorial Optimization Problems.

Ravishankar Krishnaswamy

PhD thesis, 2012

Online and Stochastic Survivable Network Design.

Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi

SIAM J. Comput., 2012

Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling.

Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Unconditional differentially private mechanisms for linear queries.

Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Inapproximability of the multi-level uncapacitated facility location problem.

Ravishankar Krishnaswamy, Maxim Sviridenko

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Approximation algorithms for stochastic orienteering.

Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Scheduling heterogeneous processors isn't as easy as you think.

Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Multicast Routing for Energy Minimization Using Speed Scaling.

Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein

Proceedings of the Design and Analysis of Algorithms, 2012

2011

Nonclairvoyantly scheduling power-heterogeneous processors.

Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs

Sustain. Comput. Informatics Syst., 2011

The Matroid Median Problem.

Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits.

Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

On Capacitated Set Cover Problems.

Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi

CoRR, 2010

Scheduling jobs with varying parallelizability to reduce variance.

Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Tree Embeddings for Two-Edge-Connected Network Design.

Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover.

Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Scalably Scheduling Power-Heterogeneous Processors.

Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Network-wide deployment of intrusion detection and prevention systems.

Vyas Sekar, Ravishankar Krishnaswamy, Anupam Gupta, Michael K. Reiter

Proceedings of the 2010 ACM Conference on Emerging Networking Experiments and Technology, 2010

2009

Scheduling with Outliers.

Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev

Proceedings of the Approximation, 2009