Ravishankar Krishnaswamy

关于

I am broadly interested in basic problems in algorithms and optimization. Lately, I have been working on design of very large scale (billions of vectors) approximate nearest neighbor search  (ANNS) as part of the Akupara project (opens in new tab). The genesis of our work lies in designing algorithms for ANNS which are capable of exploiting hybrid hardware (DRAM+SSD), and further enabling dynamic updates and supporting other real-world constraints. I also spend time thinking about basic problems in approximation algorithms, especially for graph-theoretic and clustering problems. In this space, I am particularly interested in models which incorporate evolving inputs or uncertainty in the input such as online algorithms and stochastic optimization.

A reasonably up-to-date list of my publications is available here (opens in new tab) at my external homepage.

Prior to joining MSR India, I was a Simons Postdoctoral Fellow at the Computer Science Department (opens in new tab), Princeton University until 2014. In 2012, I completed my PhD at CMU (opens in new tab) where I was fortunate to have Anupam Gupta (opens in new tab) as my advisor. Long ago, I was an undergrad at IIT Madras (opens in new tab).