2008 - 2011
Tata Institute of Fundamental Research, Mumbai
PhD. Candidate in Computer Science
2010 - 2008
National Institute of Technology Calicut
Bachelor of Technology in Computer Science & Engineering
Hardness of approximation, analysis of Boolean functions, communication complexity, combinatorics
Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan & Girish Varma. Streaming algorithms for language recognition problems., In Theoretical Computer Science, Volume 494, 8 July 2013, Pages 13-23. doi:10.1016/j.tcs.2012.12.028. Invited to special issue of TAMC 2010.
Amey Bhangale, Prahladh Harsha & Girish Varma. A characterization of hard-to-cover CSPs. To appear in Computational Complexity Conference, 2015.
Irit Dinur, Prahladh Harsha, Srikanth Srinivasan & Girish Varma. Derandomized graph product results using the low degree long code. To appear in Symp. on Theoretical Aspects of Computer Science, 2015.
Venkat Guruswami, Prahladh Harsha, Johan Hastad, Srikanth Srinivasan & Girish Varma. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. In Proc. 46th ACM Symp. on Theory of Computing (STOC), pages 614–623. 2014. doi:10.1145/2591796.2591882, acm:2591882.
Ajesh Babu, Nutan Limaye & Girish Varma. Streaming algorithms for some problems in log-space. In Proc. 23rd Theory and Applications of Models of Computation (TAMC), volume 6108 of Lecture Notes in Computer Science, pages 94-104, 2010. doi:10.1007/978-3-642-13562-0_10.
Manoj Gopalkrishnan & Girish Varma. Playing games in an uncertain world.
Girish Varma. Conductance and eigenvalue.
Google PhD Fellowship in Algorithms
Max Plank Institute for Informatics, Saarbrücken, Germany
I worked with Kurt Mehlhorn and Vincenczo Bonifaci, on a distributed algorithm for computing shortest paths in a graph, inspired by the foraging abilities of the slime mold. A mathematical model was previously proposed for the slime mold, which consist of an electrical network with time varying resistors. We proved that the model converges to the shortest path in the graph and also the rate of convergence is exponential for a subclass of graphs.
Development of a generic distributed framework for testing scalability of servers.
Approximate Counting, Almost Uniform Generation and Rapidly Mixing Markov Chains. Project as part of graduate course.
Pseudorandom Generators using the Directed Hamiltonian Path Problem. Undergraduate major project at NIT Calicut.
Parallelizing algorithms for Molecular Dynamics Computations. Undergraduate mini project at NIT Calicut.