I am an Assistant Professor at the Center for Security, Theory & Algorithms Research (CSTAR) and the Machine Learning Lab at IIIT Hyderabad. I am broadly interested in theoretical and applied computer science problems.

I did my Phd thesis on Computational Complexity theory (at TIFR Mumbai) and continues to have interest in Complexity theory, Combinatorics and Graph theory. Later I went on to do research (at IIIT Hyderabad) in Deep Learning, specifically Model Compression techniques and Semantic Segmentation for Autonomous Navigation. A summary of my research can be found here.


  • Complexity Theory & Algorithms

  • Transportation & Autonomous Navigation

  • Theory of Deep Learning

  • AI/ML in Natural Sciences


  • Postdoctoral Research, 2015 - 2016
    Weizmann Institute of Science, Israel

  • PhD and MS in Computer Science, 2015
    Tata Institute of Fundamental Research, Mumbai

  • BTech in Computer Science & Eng., 2008
    National Institute of Technology Calicut

Events & Talks

Selected Publications

Jul, 2018

Improved Visual Relocalization by Discovering Anchor Points

Soham Saha, Girish Varma, C V Jawahar
Spotlight Presentation
British Machine Vision Conference (BMVC’18)

Thumbnail [200x250]
May, 2018

Cityscale Road Audit System using Deep Learning

Sudhir Kumar Reddy, Girish Varma, C V Jawahar
JTCF Novel Technology paper award Finalist
International Conference on Intelligent Robots (IROS’18)

Thumbnail [200x250]
Jan, 2016

Hardness of Approximate Coloring

Phd Thesis advised by Prof. Prahlad Harsha
Suppored by Google India Phd Fellowship in Algorithms
Tata Institute of Fundamental Research (TIFR), Mumbai.

Thumbnail [200x250]
Dec, 2015

A Characterization of Hard-to-cover CSPs

Amey Bhangale, Prahladh Harsha, Girish Varma
Theory of Computing Journal (ToC)
Computational Complexity Conference (CCC)

Thumbnail [200x250]
Sep, 2015

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes

Venkat Guruswami, Prahladh Harsha, Johan Hastad, Srikanth Srinivasan, Girish Varma
SIAM Journal on Computing (SICOMP)
Sym. of Theory of Computing (STOC)

Thumbnail [200x250]
Sep, 2012

Physarum Can Compute Shortest Paths

Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma
Journal of Theoretical Biology (JTB)
Symp. of Discrete Algorithms (SODA)

Thumbnail [200x250]


Email: firstname [dot] lastname [at] iiit.ac.in

Phone: 1212 (prefix for external +91-40-6653)

Address: Rm: A3-118, Vindya A2, Center for Security, Theory and Algorithms Research, IIIT Hyderabad