Current Advisees:

(detailed list from theory group page)

PhD Dinesh K. : Jul 2013 - current.
MS Shom Abraham : Jul 2016 - current
MS Sagar Bisoyi : Sep 2017 - current

Previous Advisees:

  • Ph.D.
    • K S Sunil (May 2017 - Defended on Jul 8, 2017)
    • Thesis Title : Space Complexity of Labelled Graph Reachability Problems: New Characterizations and Dichotomies
      Next Position : Faculty, Govt Polytechnic, Pala, Kerala.
    • Sajin Koroth (Mar 2017 - Defended on Jul 8, 2017)
    • Thesis Title : Non-monotonicity, Projective Dimension and Circuit Depth and Size Lower Bounds
      Next Position : Postdoc, University of Haifa, Israel.
    • Balagopal Komarath (Dec 2015 - Defended on Apr 19, 2016)
    • Thesis Title : New Circuit Lower and Upper Bounds using Combinatorial Arguments
      (Winner of the Best Doctoral Dissertation Award, Dept CSE, IIT Madras, AY 2015-16)
      Next Position : Postdoc, Saarland University, Saarbr├╝cken, Germany.
  • M.S.
    • Madhuri Ravindramohan : (Jan 2015 - Aug 2017 - Next Position : Software Engg, VMware)
      Thesis Title : Algebraic Weighting Schemes and the NL vs UL Problem
    • Saurabh Sawlani (Aug 2013 - May 2015, - Next Position : PhD student at College of Computing, Georgia Tech, USA.)
      Thesis Title : Reachability, Longest Path, Unambiguous Log-space
    • Anant Dhayal (Aug 2012 - Apr 2015 - Next Position : PhD student at CSE Dept, University of California, San Diego, USA.)
      Thesis Title : Towards Making Space-bounded Non-determinism Unambiguous
    • Prasun Kumar (Jan 2011 - May 2013 - Next Position : CISCO Systems Bangalore, India)
      Thesis Title : Degree Sets : Realizability and Extension Problem
  • M.Tech.
    • Billa Surendra (May 2017, Next Position : TBA)
      Thesis Title : Implementation & Visualization of Algorithms for Degree Sequence Realizations
    • Meenakshy Ray (May 2016, Next Position : TBA)
      Thesis Title : Consequences of Sparse Hard sets for Sub-P Classes.
    • Sreeraj S. (May 2016, Next Position : Microsoft Hyderabad)
      Thesis Title : Color Refinement and Graph Isomorphism Problem.
    • Assim Ambadi (May 2015, Next Position : Member of Technical Staff at Bloomreach)
      Thesis Title : A Study of Fractional Graph Isomorphism Problem
    • Govind C. (May 2015, Next Position : Associate at Cognizant Technology Solutions (CTS))
      Thesis Title : Study on Algorithms for Computing Rotation Distance
    • Narendra Nalli (May 2015, Next Position : To Be Announced)
      Thesis Title : Approximating Graph Diameter
    • Ramnath Jayachandran (May 2014, Next Position : Samsung R&D Institute India-Bangalore)
      Thesis Title : Uniformity and Sparsity in Boolean Circuits
    • Shiv Poojan Singh (May 2014, Next Position : Citrix India)
      Thesis Title : Property Testing via Communication Complexity
    • Bikrama Senapathi (May 2013, Next position : Ameeex Solutions Chennai, India)
      Thesis Title : Study of Energy Complexity of Circuits
    • Nilkamal Adak (May 2013, Next position : Microsoft, IDC Hyderabad, India.)
      Thesis Title : Holographic Algorithms for Counting Problems.
    • Dinesh K. (May 2013, Next position : PhD Student CSE Dept, IIT Madras)
      Thesis Title : Circuit Complexity & Geometric Representation of Graphs
      (Joint-Winner, Prof. H.N. Mahabala Endowment Prize)
    • Princy Lunawat (May 2013, Next position : Microsoft, IDC Hyderabad, India.)
      Thesis Title : On the Complexity of Planar Reachability Problem.
  • B.Tech & M.Tech (Dual Degree)
    • Ameya Panse (Jun 2017, Next position : Works Applications)
      Thesis Title : Pushing the boundaries of Combinatorial Graph Isomorphism Algorithms
    • Vidhya Ramaswamy (May 2017, Next position : PhD Student, Princeton University, USA.)
      Thesis Title : Applications of Word Problems in Complexity Theory
    • Samir Otiv (May 2017, Next position : Founder & Chief Technology Officer (CTO), Maximl Labs)
      Thesis Title : Energy Complexity of Computational Circuits
    • Devanathan Thiruvenkitachari (May 2014, Next position : PhD Student, New York University, USA.)
      Thesis Title : Algorithms for Factorization of Polynomials under ERH
  • B.Tech
    • Ajay Krishna A. (May 2016)
      Thesis Title : Matroid Intersection Problem : Combinatorial and Algebraic Approaches
    • Naga Varun K. (May 2016)
      Thesis Title : On the smallest Grammar Problem for Conjuctive Grammars
    • Aarati Kakaraparthy (May 2015)
      Thesis Title : A Combinatorial Approach to Disjoint Cover vs Protocol Cover Problem
    • Akshay Degwekar (May 2014, Next position : Ph.D. student, MIT, USA)
      Thesis Title : Pseudorandomness for Space Bounded Computation
    • Saurabh Sawlani (May 2013, Next position : MS Student, CSE Dept, IIT Madras)
      Thesis Title : Combinatorics of Degree Sets
    • Prashant Vasudevan (May 2013, Next position : PhD Student, MIT, USA)
      Thesis Title : Determinantal Complexity Under Restrictions
    • Sivaramakrishnan N.R. (May 2013, Next position : PhD Student, University of Washington, USA)
      Thesis Title : Incompressibility in Time and Space.
    • Mrinal Kumar (May 2012, Next position : PhD Student, Rutgers University, USA)
      Gaurav Maheswari (May 2012, Next Position : Goldman Sachs, Bangalore, India.)
      Thesis Title : New Size Lower bounds Against Non-multilinear Arithmetic Circuits.
      (Mrinal's thesis work: Algorithms for Subgraph Isomorphism and Graph Modification Problems was advised by Saket Saurabh.)

  • Last update: Tue Mar 15 08:50:58 IST 2016.