Ravishankar Krishnaswamy

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 33

Top Topics

Energy Efficient Routing

Correlation Clustering

Nearest Neighbor Search

Facility Location

Top Venues

Publications

Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing. SIAM J. Comput. 53 (3) (2024)
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan
Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments. ITCS (2023)
Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. STOC (2023)
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
Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters. WWW (2023)
Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Discrepancy with Recourse for Vectors and Graphs. SODA (2022)
Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. CoRR (2022)
Shikhar Jaiswal, Ravishankar Krishnaswamy, Ankit Garg, Harsha Vardhan Simhadri, Sheshansh Agrawal
OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries. CoRR (2022)
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
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search. CoRR (2022)
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
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search. NeurIPS (Competition and Demos) (2021)
Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Discrepancy with Recourse for Vectors and Graphs. CoRR (2021)
Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy, Harsha Vardhan Simhadri
FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search. CoRR (2021)
Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
-Center Problem. ACM Trans. Algorithms 16 (4) (2020)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Carpooling Using Expander Decompositions. FSTTCS (2020)
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep
Permutation Strikes Back: The Power of Recourse in Online Metric Matching. APPROX-RANDOM (2020)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Carpooling using Expander Decompositions. CoRR (2020)
Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49 (1) (2020)
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching. CoRR (2019)
Suhas Jayaram Subramanya, Fnu Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnaswamy, Rohan Kadekodi
Rand-NSG: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. NeurIPS (2019)
Devvrit, Ravishankar Krishnaswamy, Nived Rajaraman
Robust Correlation Clustering. APPROX-RANDOM (2019)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
Elastic Caching. SODA (2019)
Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
Online Buy-at-Bulk Network Design. SIAM J. Comput. 47 (4) (2018)
Ravishankar Krishnaswamy, Shi Li, Sai Sandeep
Constant approximation for k-median and k-means with outliers via iterative rounding. STOC (2018)
Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
The Heterogeneous Capacitated k-Center Problem. IPCO (2017)
Ravishankar Krishnaswamy, Shi Li, Sai Sandeep
Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding. CoRR (2017)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
Online and dynamic algorithms for set cover. STOC (2017)
Aditi Raghunathan, Prateek Jain, Ravishankar Krishnaswamy
Learning Mixture of Gaussians with Streaming Data. NIPS (2017)
Aditi Raghunathan, Ravishankar Krishnaswamy, Prateek Jain
Learning Mixture of Gaussians with Streaming Data. CoRR (2017)
Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
The Heterogeneous Capacitated $k$-Center Problem. CoRR (2016)
Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
The Non-Uniform k-Center Problem. CoRR (2016)
Ravishankar Krishnaswamy, Maxim Sviridenko
Inapproximability of the Multilevel Uncapacitated Facility Location Problem. ACM Trans. Algorithms 13 (1) (2016)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
Online and Dynamic Algorithms for Set Cover. CoRR (2016)
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop
Spectral Embedding of k-Cliques, Graph Partitioning and k-Means. ITCS (2016)
Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
The Non-Uniform k-Center Problem. ICALP (2016)
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop
The Hardness of Approximation of Euclidean k-means. CoRR (2015)
Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi
Online Buy-at-Bulk Network Design. FOCS (2015)
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. APPROX-RANDOM (2015)
Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha
Facility Location with Matroid or Knapsack Constraints. Math. Oper. Res. 40 (2) (2015)
Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
Online Buy-at-Bulk Network Design. CoRR (2015)
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering. Math. Oper. Res. 40 (1) (2015)
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop
The Hardness of Approximation of Euclidean k-Means. SoCG (2015)
Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel Ward
Relax, No Need to Round: Integrality of Clustering Formulations. ITCS (2015)
Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing. CoRR (2014)
Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel Ward
Relax, no need to round: integrality of clustering formulations. CoRR (2014)
Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan
Better Scalable Algorithms for Broadcast Scheduling. ACM Trans. Algorithms 11 (1) (2014)
Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. SODA (2014)
Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. STOC (2014)
Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA (2014)
Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan
Capacitated Network Design on Undirected Graphs. APPROX-RANDOM (2013)
Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder
Minimum Makespan Scheduling with Low Rank Processing Times. SODA (2013)
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
Online and Stochastic Survivable Network Design. SIAM J. Comput. 41 (6) (2012)
Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs
Scheduling heterogeneous processors isn't as easy as you think. SODA (2012)
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
Approximation algorithms for stochastic orienteering. SODA (2012)
Ravishankar Krishnaswamy, Maxim Sviridenko
Inapproximability of the multi-level uncapacitated facility location problem. SODA (2012)
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. WAOA (2012)
Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar
Unconditional differentially private mechanisms for linear queries. STOC (2012)
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg (2012)
Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha
The Matroid Median Problem. SODA (2011)
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
Scalably Scheduling Power-Heterogeneous Processors CoRR (2011)
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS (2011)
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits CoRR (2011)
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
Nonclairvoyantly scheduling power-heterogeneous processors. Sustain. Comput. Informatics Syst. 1 (3) (2011)
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling CoRR (2011)
Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha
On Capacitated Set Cover Problems. APPROX-RANDOM (2011)
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems CoRR (2010)
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
Scalably Scheduling Power-Heterogeneous Processors. ICALP (1) (2010)
Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs
Scheduling jobs with varying parallelizability to reduce variance. SPAA (2010)
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
Nonclairvoyantly scheduling power-heterogeneous processors. Green Computing Conference (2010)
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
Tree Embeddings for Two-Edge-Connected Network Design. SODA (2010)
Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan
Better Scalable Algorithms for Broadcast Scheduling. ICALP (1) (2010)
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. SODA (2010)
Vyas Sekar, Ravishankar Krishnaswamy, Anupam Gupta, Michael K. Reiter
Network-wide deployment of intrusion detection and prevention systems. CoNEXT (2010)
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
Online and stochastic survivable network design. STOC (2009)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
Scheduling with Outliers. APPROX-RANDOM (2009)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
Scheduling with Outliers CoRR (2009)