Ravishankar Krishnaswamy

Senior Principal Researcher

Publications

View by:

- Graph-Based Algorithms for Diverse Similarity Search
  
  Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kiran Shiragur, Haike Xu
  
  ICML 2025 | July 2025
  
  Publication
- The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search
  
  Ravishankar Krishnaswamy, Ravishankar Krishnaswamy, M. Manohar, Harsha Simhadri
  
  IEEE Data Eng. Bull. | December 2024, Vol 48: pp. 20-42
  
  Publication Project
- Online Discrepancy with Recourse for Vectors and Graphs
  
  Ravishankar Krishnaswamy
  
  SIAM Symposium on Discrete Algorithms 2022 | January 2022
  
  Publication Project
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
  
  Harsha Simhadri, Ravishankar Krishnaswamy
  
  May 2021
  
  Publication Project
- Elastic Caching
  
  Ravishankar Krishnaswamy
  
  January 2020
  
  Publication Project
- DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node
  
  Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Krishnaswamy, Harsha Simhadri
  
  NeurIPS 2019 | November 2019
  
  PDF Github Project
- Learning Mixture of Gaussians with Streaming Data
  
  Aditi Raghunathan, Ravishankar Krishnaswamy, Prateek Jain
  
  July 2017
  
  Publication
- Online and dynamic algorithms for set cover
  
  Ravishankar Krishnaswamy, Anupam Gupta, Amit Kumar, Debmalya Panigrahi
  
  STOC 2017 Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | June 2017
  
  Publication Project
- The Non-Uniform k-Center Problem
  
  Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
  
  43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy | July 2016
  
  ISBN: 978-3-95977-013-2
  
  Publication Publication
- Online Buy-at-Bulk Network Design
  
  Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
  
  FOCS '15 Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) | October 2015
  
  ISBN: 978-1-4673-8191-8
  
  Publication Publication
- Relax, No Need to Round: Integrality of Clustering Formulations
  
  Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel Ward
  
  Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | January 2015
  
  ISBN: 978-1-4503-3333-7
  
  Publication Publication
- Cluster Before You Hallucinate: Approximating Node-capacitated Network Design and Energy Efficient Routing
  
  Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
  
  Proceedings of the 46th Annual ACM Symposium on Theory of Computing | May 2014
  
  Proceedings of the 46th Annual ACM Symposium on Theory of Computing
  
  ISBN: 978-1-4503-2710-7
  
  Publication Publication
- 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 | January 2014
  
  Chapter 5, in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
  
  ISBN: 978-1-61197-338-9
  
  Publication
- Hallucination Helps: Energy Efficient Virtual Circuit Routing
  
  Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
  
  Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | January 2014
  
  Chapter 84, in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
  
  Publication
- Approximation Algorithms for Stochastic Orienteering
  
  Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
  
  SODA | January 2012
  
  Publication
- Approximation Algorithms for Correlated Knapsack and Non-Martingale Bandits
  
  Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
  
  Foundations of Computer Science | October 2011
  
  Publication

- Graph-Based Algorithms for Diverse Similarity Search
  
  Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kiran Shiragur, Haike Xu
  
  ICML 2025 | July 2025
  
  Publication
- The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search
  
  Ravishankar Krishnaswamy, Ravishankar Krishnaswamy, M. Manohar, Harsha Simhadri
  
  IEEE Data Eng. Bull. | December 2024, Vol 48: pp. 20-42
  
  Publication Project
- Online Discrepancy with Recourse for Vectors and Graphs
  
  Ravishankar Krishnaswamy
  
  SIAM Symposium on Discrete Algorithms 2022 | January 2022
  
  Publication Project
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
  
  Harsha Simhadri, Ravishankar Krishnaswamy
  
  May 2021
  
  Publication Project
- Elastic Caching
  
  Ravishankar Krishnaswamy
  
  January 2020
  
  Publication Project
- DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node
  
  Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Krishnaswamy, Harsha Simhadri
  
  NeurIPS 2019 | November 2019
  
  PDF Github Project
- Learning Mixture of Gaussians with Streaming Data
  
  Aditi Raghunathan, Ravishankar Krishnaswamy, Prateek Jain
  
  July 2017
  
  Publication
- Online and dynamic algorithms for set cover
  
  Ravishankar Krishnaswamy, Anupam Gupta, Amit Kumar, Debmalya Panigrahi
  
  STOC 2017 Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | June 2017
  
  Publication Project
- The Non-Uniform k-Center Problem
  
  Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
  
  43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy | July 2016
  
  ISBN: 978-3-95977-013-2
  
  Publication Publication
- Online Buy-at-Bulk Network Design
  
  Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
  
  FOCS '15 Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) | October 2015
  
  ISBN: 978-1-4673-8191-8
  
  Publication Publication
- Relax, No Need to Round: Integrality of Clustering Formulations
  
  Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel Ward
  
  Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | January 2015
  
  ISBN: 978-1-4503-3333-7
  
  Publication Publication
- Cluster Before You Hallucinate: Approximating Node-capacitated Network Design and Energy Efficient Routing
  
  Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
  
  Proceedings of the 46th Annual ACM Symposium on Theory of Computing | May 2014
  
  Proceedings of the 46th Annual ACM Symposium on Theory of Computing
  
  ISBN: 978-1-4503-2710-7
  
  Publication Publication
- Hallucination Helps: Energy Efficient Virtual Circuit Routing
  
  Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
  
  Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | January 2014
  
  Chapter 84, in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
  
  Publication
- 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 | January 2014
  
  Chapter 5, in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
  
  ISBN: 978-1-61197-338-9
  
  Publication
- Approximation Algorithms for Stochastic Orienteering
  
  Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
  
  SODA | January 2012
  
  Publication
- Approximation Algorithms for Correlated Knapsack and Non-Martingale Bandits
  
  Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
  
  Foundations of Computer Science | October 2011
  
  Publication
- Graph-Based Algorithms for Diverse Similarity Search
  
  Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kiran Shiragur, Haike Xu
  
  ICML 2025 | July 2025
  
  Publication
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
  
  Harsha Simhadri, Ravishankar Krishnaswamy
  
  May 2021
  
  Publication Project
- Learning Mixture of Gaussians with Streaming Data
  
  Aditi Raghunathan, Ravishankar Krishnaswamy, Prateek Jain
  
  July 2017
  
  Publication

- The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search
  
  Ravishankar Krishnaswamy, Ravishankar Krishnaswamy, M. Manohar, Harsha Simhadri
  
  IEEE Data Eng. Bull. | December 2024, Vol 48: pp. 20-42
  
  Publication Project
- Graph-Based Algorithms for Diverse Similarity Search
  
  Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kiran Shiragur, Haike Xu
  
  ICML 2025 | July 2025
  
  Publication
- Online Discrepancy with Recourse for Vectors and Graphs
  
  Ravishankar Krishnaswamy
  
  SIAM Symposium on Discrete Algorithms 2022 | January 2022
  
  Publication Project
- Elastic Caching
  
  Ravishankar Krishnaswamy
  
  January 2020
  
  Publication Project
- DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node
  
  Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Krishnaswamy, Harsha Simhadri
  
  NeurIPS 2019 | November 2019
  
  PDF Github Project
- Online and dynamic algorithms for set cover
  
  Ravishankar Krishnaswamy, Anupam Gupta, Amit Kumar, Debmalya Panigrahi
  
  STOC 2017 Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | June 2017
  
  Publication Project
- The Non-Uniform k-Center Problem
  
  Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
  
  43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy | July 2016
  
  ISBN: 978-3-95977-013-2
  
  Publication Publication
- Online Buy-at-Bulk Network Design
  
  Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
  
  FOCS '15 Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) | October 2015
  
  ISBN: 978-1-4673-8191-8
  
  Publication Publication
- Relax, No Need to Round: Integrality of Clustering Formulations
  
  Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel Ward
  
  Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | January 2015
  
  ISBN: 978-1-4503-3333-7
  
  Publication Publication
- Cluster Before You Hallucinate: Approximating Node-capacitated Network Design and Energy Efficient Routing
  
  Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
  
  Proceedings of the 46th Annual ACM Symposium on Theory of Computing | May 2014
  
  Proceedings of the 46th Annual ACM Symposium on Theory of Computing
  
  ISBN: 978-1-4503-2710-7
  
  Publication Publication
- Hallucination Helps: Energy Efficient Virtual Circuit Routing
  
  Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
  
  Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | January 2014
  
  Chapter 84, in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
  
  Publication
- 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 | January 2014
  
  Chapter 5, in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
  
  ISBN: 978-1-61197-338-9
  
  Publication
- Approximation Algorithms for Stochastic Orienteering
  
  Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
  
  SODA | January 2012
  
  Publication
- Approximation Algorithms for Correlated Knapsack and Non-Martingale Bandits
  
  Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
  
  Foundations of Computer Science | October 2011
  
  Publication
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
  
  Harsha Simhadri, Ravishankar Krishnaswamy
  
  May 2021
  
  Publication Project
- Learning Mixture of Gaussians with Streaming Data
  
  Aditi Raghunathan, Ravishankar Krishnaswamy, Prateek Jain
  
  July 2017
  
  Publication

Ravishankar Krishnaswamy

Publications

Graph-Based Algorithms for Diverse Similarity Search

The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search

Online Discrepancy with Recourse for Vectors and Graphs

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

Elastic Caching

DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node

Learning Mixture of Gaussians with Streaming Data

Online and dynamic algorithms for set cover

The Non-Uniform k-Center Problem

Online Buy-at-Bulk Network Design

Relax, No Need to Round: Integrality of Clustering Formulations

Cluster Before You Hallucinate: Approximating Node-capacitated Network Design and Energy Efficient Routing

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach

Hallucination Helps: Energy Efficient Virtual Circuit Routing

Approximation Algorithms for Stochastic Orienteering

Approximation Algorithms for Correlated Knapsack and Non-Martingale Bandits

Graph-Based Algorithms for Diverse Similarity Search

The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search

Online Discrepancy with Recourse for Vectors and Graphs

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

Elastic Caching

DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node

Learning Mixture of Gaussians with Streaming Data

Online and dynamic algorithms for set cover

The Non-Uniform k-Center Problem

Online Buy-at-Bulk Network Design

Relax, No Need to Round: Integrality of Clustering Formulations

Cluster Before You Hallucinate: Approximating Node-capacitated Network Design and Energy Efficient Routing

Hallucination Helps: Energy Efficient Virtual Circuit Routing

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach

Approximation Algorithms for Stochastic Orienteering

Approximation Algorithms for Correlated Knapsack and Non-Martingale Bandits

Graph-Based Algorithms for Diverse Similarity Search

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

Learning Mixture of Gaussians with Streaming Data

The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search

Graph-Based Algorithms for Diverse Similarity Search

Online Discrepancy with Recourse for Vectors and Graphs

Elastic Caching

DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node

Online and dynamic algorithms for set cover

The Non-Uniform k-Center Problem

Online Buy-at-Bulk Network Design

Relax, No Need to Round: Integrality of Clustering Formulations

Cluster Before You Hallucinate: Approximating Node-capacitated Network Design and Energy Efficient Routing

Hallucination Helps: Energy Efficient Virtual Circuit Routing

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach

Approximation Algorithms for Stochastic Orienteering

Approximation Algorithms for Correlated Knapsack and Non-Martingale Bandits

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

Learning Mixture of Gaussians with Streaming Data