default search action
Ravishankar Krishnaswamy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]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): 588-623 (2024) - 2023
- [c43]Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan:
Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments. ITCS 2023: 65:1-65:17 - [c42]Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana:
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. STOC 2023: 775-788 - [c41]Siddharth Gollapudi
Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters. WWW 2023: 3406-3416 - 2022
- [c40]Anupam Gupta
Online Discrepancy with Recourse for Vectors and Graphs. SODA 2022: 1356-1383 - [i21]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 abs/2205.03763 (2022) - [i20]Shikhar Jaiswal, Ravishankar Krishnaswamy, Ankit Garg, Harsha Vardhan Simhadri, Sheshansh Agrawal:
OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries. CoRR abs/2211.12850 (2022) - [i19]Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana:
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. CoRR abs/2211.16216 (2022) - 2021
- [c39]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: 177-189 - [i18]Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy, Harsha Vardhan Simhadri:
FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search. CoRR abs/2105.09613 (2021) - [i17]Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla:
Online Discrepancy with Recourse for Vectors and Graphs. CoRR abs/2111.06308 (2021) - 2020
- [j9]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49(1): 37-66 (2020) - [j8]Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy:
The Non-Uniform k-Center Problem. ACM Trans. Algorithms 16(4): 46:1-46:19 (2020) - [c38]Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep:
Permutation Strikes Back: The Power of Recourse in Online Metric Matching. APPROX-RANDOM 2020: 40:1-40:20 - [c37]Anupam Gupta
Online Carpooling Using Expander Decompositions. FSTTCS 2020: 23:1-23:14 - [i16]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla:
Online Carpooling using Expander Decompositions. CoRR abs/2007.10545 (2020)
2010 – 2019
- 2019
- [c36]Devvrit, Ravishankar Krishnaswamy, Nived Rajaraman:
Robust Correlation Clustering. APPROX-RANDOM 2019: 33:1-33:18 - [c35]Suhas Jayaram Subramanya, Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnaswamy, Rohan Kadekodi:
Rand-NSG: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. NeurIPS 2019: 13748-13758 - [c34]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar
Elastic Caching. SODA 2019: 143-156 - [i15]Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep:
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching. CoRR abs/1911.12778 (2019) - 2018
- [j7]Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. SIAM J. Comput. 47(4): 1505-1528 (2018) - [c33]Ravishankar Krishnaswamy, Shi Li, Sai Sandeep:
Constant approximation for k-median and k-means with outliers via iterative rounding. STOC 2018: 646-659 - 2017
- [c32]Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
The Heterogeneous Capacitated k-Center Problem. IPCO 2017: 123-135 - [c31]Aditi Raghunathan, Prateek Jain, Ravishankar Krishnaswamy:
Learning Mixture of Gaussians with Streaming Data. NIPS 2017: 6605-6614 - [c30]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar
Online and dynamic algorithms for set cover. STOC 2017: 537-550 - [i14]Aditi Raghunathan, Ravishankar Krishnaswamy, Prateek Jain:
Learning Mixture of Gaussians with Streaming Data. CoRR abs/1707.02391 (2017) - [i13]Ravishankar Krishnaswamy, Shi Li, Sai Sandeep:
Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding. CoRR abs/1711.01323 (2017) - 2016
- [j6]Ravishankar Krishnaswamy, Maxim Sviridenko:
Inapproximability of the Multilevel Uncapacitated Facility Location Problem. ACM Trans. Algorithms 13(1): 1:1-1:25 (2016) - [c29]Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy:
The Non-Uniform k-Center Problem. ICALP 2016: 67:1-67:15 - [c28]Pranjal Awasthi, Moses Charikar
Spectral Embedding of k-Cliques, Graph Partitioning and k-Means. ITCS 2016: 301-310 - [r1]Ravishankar Krishnaswamy:
Broadcast Scheduling - Minimizing Average Response Time. Encyclopedia of Algorithms 2016: 237-240 - [i12]Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy:
The Non-Uniform k-Center Problem. CoRR abs/1605.03692 (2016) - [i11]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi:
Online and Dynamic Algorithms for Set Cover. CoRR abs/1611.05646 (2016) - [i10]Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar:
The Heterogeneous Capacitated $k$-Center Problem. CoRR abs/1611.07414 (2016) - 2015
- [j5]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering. Math. Oper. Res. 40(1): 56-79 (2015) - [j4]Ravishankar Krishnaswamy, Amit Kumar
Facility Location with Matroid or Knapsack Constraints. Math. Oper. Res. 40(2): 446-459 (2015) - [c27]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. APPROX-RANDOM 2015: 96-109 - [c26]Pranjal Awasthi, Moses Charikar
The Hardness of Approximation of Euclidean k-Means. SoCG 2015: 754-767 - [c25]Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. FOCS 2015: 545-562 - [c24]Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar
Relax, No Need to Round: Integrality of Clustering Formulations. ITCS 2015: 191-200 - [i9]Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
The Hardness of Approximation of Euclidean k-means. CoRR abs/1502.03316 (2015) - [i8]Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. CoRR abs/1509.03212 (2015) - 2014
- [j3]Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan:
Better Scalable Algorithms for Broadcast Scheduling. ACM Trans. Algorithms 11(1): 3:1-3:24 (2014) - [c23]Nikhil Bansal, Moses Charikar
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. SODA 2014: 55-71 - [c22]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - [c21]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing. STOC 2014: 734-743 - [i7]Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing. CoRR abs/1403.6207 (2014) - [i6]Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar, Ravishankar Krishnaswamy, Soledad Villar, Rachel A. Ward:
Relax, no need to round: integrality of clustering formulations. CoRR abs/1408.4045 (2014) - 2013
- [c20]Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan:
Capacitated Network Design on Undirected Graphs. APPROX-RANDOM 2013: 71-80 - [c19]Aditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder:
Minimum Makespan Scheduling with Low Rank Processing Times. SODA 2013: 937-947 - 2012
- [b1]Ravishankar Krishnaswamy:
Approximation Techniques for Stochastic Combinatorial Optimization Problems. Carnegie Mellon University, USA, 2012 - [j2]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi:
Online and Stochastic Survivable Network Design. SIAM J. Comput. 41(6): 1649-1672 (2012) - [c18]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg 2012: 37-51 - [c17]Ravishankar Krishnaswamy, Maxim Sviridenko:
Inapproximability of the multi-level uncapacitated facility location problem. SODA 2012: 718-734 - [c16]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253 - [c15]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Approximation algorithms for stochastic orienteering. SODA 2012: 1522-1538 - [c14]Aditya Bhaskara, Daniel Dadush
Unconditional differentially private mechanisms for linear queries. STOC 2012: 1269-1284 - [c13]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. WAOA 2012: 173-186 - 2011
- [j1]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Nonclairvoyantly scheduling power-heterogeneous processors. Sustain. Comput. Informatics Syst. 1(3): 248-255 (2011) - [c12]Nikhil Bansal, Ravishankar Krishnaswamy, Barna Saha:
On Capacitated Set Cover Problems. APPROX-RANDOM 2011: 38-49 - [c11]Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi:
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS 2011: 827-836 - [c10]Ravishankar Krishnaswamy, Amit Kumar
The Matroid Median Problem. SODA 2011: 1117-1130 - [i5]Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi:
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits. CoRR abs/1102.3749 (2011) - [i4]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Scalably Scheduling Power-Heterogeneous Processors. CoRR abs/1105.3748 (2011) - [i3]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling. CoRR abs/1109.5931 (2011) - 2010
- [c9]Vyas Sekar, Ravishankar Krishnaswamy, Anupam Gupta, Michael K. Reiter:
Network-wide deployment of intrusion detection and prevention systems. CoNEXT 2010: 18 - [c8]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Nonclairvoyantly scheduling power-heterogeneous processors. Green Computing Conference 2010: 165-173 - [c7]Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Scalably Scheduling Power-Heterogeneous Processors. ICALP (1) 2010: 312-323 - [c6]Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan:
Better Scalable Algorithms for Broadcast Scheduling. ICALP (1) 2010: 324-335 - [c5]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi:
Tree Embeddings for Two-Edge-Connected Network Design. SODA 2010: 1521-1538 - [c4]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy:
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. SODA 2010: 1539-1545 - [c3]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20 - [i2]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. CoRR abs/1003.0722 (2010)
2000 – 2009
- 2009
- [c2]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar
Scheduling with Outliers. APPROX-RANDOM 2009: 149-162 - [c1]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi:
Online and stochastic survivable network design. STOC 2009: 685-694 - [i1]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev:
Scheduling with Outliers. CoRR abs/0906.2020 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: