Previously I did my Phd thesis on Computational Complexity theory and continues to have interest in Complexity theory, Combinatorics and Graph theory.
Postdoctoral Research, 2016
Weizmann Institute of Science, Israel
PhD in Computer Science, 2015
Tata Institute of Fundamental Research, Mumbai
MS in Computer Science, 2011
Tata Institute of Fundamental Research, Mumbai
BTech in Computer Science & Eng., 2008
National Institute of Technology Calicut
Improved lowerbounds for graph/hypergraph coloring.
Make deep learning models deployable in constrained memory devices.
Formal proof for slime-molds finding shortest paths in maze.
Improved PCPs using low-degree codes and using product constructions.
Few pass, small memory algorithms for big data.