Home

Hi, welcome to my webpage!

 

Currently, I am working as an Assistant Professor in the Department of Computer Science and Engineering at IIT Hyderabad.


Prior to joining IITH, I spent three pleasant years in the Shivalik Range of the Himalayas as an Assistant Professor at the School of Computing and Electrical Engineering (SCEE), IIT Mandi.


I am an algorithmist, and work in the intersection  of theory and practice. I am interested in developing "extremely simple",  practical approximation algorithms with provable performance guarantees for real-world problems. Among other things, my current research focuses around sketching/dimensionality reduction algorithms. In particular, I'm  focusing on: a) developing new sketching/dimensionality reduction algorithms for various data types and similarity measures, b) improving existing sketching/dimensionality reduction algorithms by making them fast, scalable  and accurate, and c) exploring applicability of such results in various machine learning tasks such as learning node embedding in large scale network, itemset mining, model compression etc.

 

I generally use  techniques  from matrix algebra, sampling, random projection, and randomized hashing.  


I earned my Ph.D. in Theoretical Computer Science from  Chennai Mathematical Institute.  


Previously, I have been working with industry research labs in the areas of algorithms in Data Science and Machine Learning at Wipro-AI Research, Bangalore; and TCS Innovation Labs, New Delhi. I have also spent a few months at IIIT Bangalore as a Research Associate. 


Openings: I'm looking for highly motivated MS/PhD students to work on the  areas mentioned above. 



=========================================================

Ph.D.  Hiring: I am looking for highly motivated PhD students to work in the areas of “developing scalable similarity search algorithms for tensors”(under the board areas of algorithms for massive datasets). The candidates should have a solid foundation in algorithm design and analysis, linear algebra, and probability theory.




For eligibility criteria and other details, please refer to https://cse.iith.ac.in/admissions/phd.html




=========================================================


Note: I am not hiring for any internship/short-term project position. Unfortunately, I am not able to individually respond to such queries. If you are interested, please apply through the IITH SURE internship program as and when they are put up on the institute’s website.   










My Erdös Number is 3.


Recent News: 










                                                                                                                                                   

Old News:


IITH  is offering summer internship under Summer Undergraduate Research Exposure (SURE) scheme. The link for the applications is as follows: https://iith.ac.in/research/SURE/

Applications may be submitted by 22th Feb. 2023.


















1) Randomness Efficient Feature Hashing for Sparse Binary Data. Joint work with Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni.

2) Scaling up Simhash. Joint work with Anup Deshmukh, Pratheeksha Nair, Anirudh Ravi. This paper was also invited for Special Issue in Springer Nature Computer Science.