Ravishankar Krishnaswamy

Orcid: 0000-0002-5765-0843

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing.
SIAM J. Comput., 2024

2023
Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters.
Proceedings of the ACM Web Conference 2023, 2023

Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

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

Online Discrepancy with Recourse for Vectors and Graphs.
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.
CoRR, 2021

Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search.
Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track, 2021

2020
The Non-Uniform <i>k</i>-Center Problem.
ACM Trans. Algorithms, 2020

Hallucination Helps: Energy Efficient Virtual Circuit Routing.
SIAM J. Comput., 2020

Online Carpooling Using Expander Decompositions.
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.
Proceedings of the Approximation, 2020

2019
Elastic Caching.
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.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Robust Correlation Clustering.
Proceedings of the Approximation, 2019

2018
Online Buy-at-Bulk Network Design.
SIAM J. Comput., 2018

Constant approximation for k-median and k-means with outliers via iterative rounding.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Online and dynamic algorithms for set cover.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Learning Mixture of Gaussians with Streaming Data.
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.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Broadcast Scheduling - Minimizing Average Response Time.
Encyclopedia of Algorithms, 2016

Inapproximability of the Multilevel Uncapacitated Facility Location Problem.
ACM Trans. Algorithms, 2016

Spectral Embedding of k-Cliques, Graph Partitioning and k-Means.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

The Non-Uniform k-Center Problem.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Facility Location with Matroid or Knapsack Constraints.
Math. Oper. Res., 2015

Running Errands in Time: Approximation Algorithms for Stochastic Orienteering.
Math. Oper. Res., 2015

Relax, No Need to Round: Integrality of Clustering Formulations.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

The Hardness of Approximation of Euclidean k-Means.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs.
Proceedings of the Approximation, 2015

2014
Better Scalable Algorithms for Broadcast Scheduling.
ACM Trans. Algorithms, 2014

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing.
Proceedings of the Symposium on Theory of Computing, 2014

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Minimum Makespan Scheduling with Low Rank Processing Times.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Capacitated Network Design on Undirected Graphs.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Approximation Techniques for Stochastic Combinatorial Optimization Problems.
PhD thesis, 2012

Online and Stochastic Survivable Network Design.
SIAM J. Comput., 2012

Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Unconditional differentially private mechanisms for linear queries.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Inapproximability of the multi-level uncapacitated facility location problem.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Approximation algorithms for stochastic orienteering.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Scheduling heterogeneous processors isn't as easy as you think.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Multicast Routing for Energy Minimization Using Speed Scaling.
Proceedings of the Design and Analysis of Algorithms, 2012

2011
Nonclairvoyantly scheduling power-heterogeneous processors.
Sustain. Comput. Informatics Syst., 2011

The Matroid Median Problem.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

On Capacitated Set Cover Problems.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
CoRR, 2010

Scheduling jobs with varying parallelizability to reduce variance.
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.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Scalably Scheduling Power-Heterogeneous Processors.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Network-wide deployment of intrusion detection and prevention systems.
Proceedings of the 2010 ACM Conference on Emerging Networking Experiments and Technology, 2010

2009
Scheduling with Outliers.
Proceedings of the Approximation, 2009


  Loading...