Current Advisees : (list from theory group page)
PhD:Anoop S.K.M. : Jul 2018 - current.
PhD:Nagashri K. : Jul 2021 - current.
PhD:Neha Kuntewar : Jan 2022 - current.
PhD:Bhabya Deep Rai : Mar 2022 - current.
PhD:Sutanay Bhattacharjee : Aug 2022 - current.
 
To prospective graduate (MS/PhD) students: I work extensively in the area of computational complexity theory which actually is not as complex as it may sound. In order to work with me, it is not necessary that you have already been trained in complexity theory before coming to IITM - we do have a sequence of courses for that. A great taste in mathematical arguments in general, and an appreciation for subjects like theory of computation and discrete mathematics will be more than enough.
To prospective (B.Tech/M.Tech) students: Please try to do as many elective courses as you can in the sequence of courses. Some of them would have already given you some exposure to frontier research problems. For B.Tech students, for whom the project is only for 6 months, please do consider doing a undergraduate research course (UGRC) before the project, which you can also continue towards the project with deeper goals after the UGRC.

Previous Advisees:   [Postdoc]   [PhD]   [MS]   [M.Tech]   [B.Tech(DD)]   [B.Tech]   [Interns]
(Note : (1) Reverse chronological order for each list. (2) This list does not contain students who have discontinued the program/project in between.)

  • Postdoctoral Fellows:
    • Manasi Kulkarni (Aug 2019 - Jul 2020) - NBHM Postdoctoral Fellow.
    • Research Direction : Word Problems and Complexity Theory
      Next Position : Faculty, Indian Institute of Information Technology (IIIT), Vadodara, Gujarat, India.
    • Swaroop N.P. (Nov 2018 - Oct 2019) - IITM Institute Postdoc - Jointly hosted with Raghavdendra Rao.
    • Research Direction : Polynomial Equivalence Problem
      Next Position : Samsung Research, Bangalore.
    • Enduri Murali Krishna (Feb 2018 - Aug 2018) - IITM Insitute Postdoc - Jointly hosted with Raghavdendra Rao.
    • Research Direction : Monotone Dualization Problem
      Next Position : Faculty, Dept of CSE, SRM University, Amaravathi Campus.
  • Ph.D.
  • M.S.(by research)
    • Amit Roy : (Jul 2018 - Jun 2021) - Next Position : Software Engineer, CISCO, Bangalore)
      Thesis Title : New Bounds and Variants of VC Dimension of Boolean Function Classes
    • Sagar Bisoyi : (Jul 2017 - Jun 2020) - Next Position : Samsung R&D, Bangalore)
      Thesis Title : On Pure Space, Catayltic Space and Codes
    • 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.
    • Sudhanshu Gautam (May 2024, Next Position : Software Engineer, )
      Thesis Title : Approximation Algorithms for Sorting by Reverals and Transpositions
    • Harikrishnan E.A. (May 2021, Next Position : TBA)
      Thesis Title : Degree Sequences - Parallelization and Connectivity
    • Akshay Potey (May 2020, Next Position : TBA)
      Thesis Title : Study of Total Space in Resolution Proof Systems
    • Billa Surendra (May 2017, Next Position : Member of Technical Staff, CDAC, Bangalore.)
      Thesis Title : Implementation & Visualization of Algorithms for Degree Sequence Realizations
    • Meenakshy Ray (May 2016, Next Position : SAP Labs Bangalore)
      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.
    • Krishnamoorthy Dinesh (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 for Best M.Tech Project in CSE Dept in 2013))
    • 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)
    • Gautam Chandrasekharan (May 2022, Next position : PhD Student, UT Austin.)
      Thesis Title : Matrix Rigidty : Symmetry and Geometric Representation of Graphs
      (Joint-Winner, B. Lakshmi Ravi Best Dual Degree Project Award in CSE in 2022)
    • Michael Mervin Christy (May 2022, Next position : Google Inc.)
      Thesis Title : On Projective Dimension of Graphs and Variants
    • Tarun Banavath (May 2022, Next position : TBA)
      Thesis Title : On Cyclic Boolean Circuits
    • Balasankar Rajamohan (May 2021, Next position : TBA)
      Thesis Title : On Hazard-free Circuits
    • Vignesh Manoharan (May 2019, Next position : PhD Student, UT Austin, USA.)
      Thesis Title : The Group Isomorphism Problem: Color Refinement and Other Approaches
      (Joint-Winner, B. Lakshmi Ravi Best Dual Degree Project Award in CSE in 2019)
    • 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
    • Tahir Yusuf Sandalwala (May 2024, Next position : TBA)
      Thesis Title : On Unary 2NFA vs 2DFA, Branching Programs and the NL vs L/poly Problem
    • Nalli Sai Soumya (May 2024, Next position : TBA)
      Thesis Title : Quick Decisions are Hazardous when Highly Sensitive
      (Winner, Prof. C. Sivaram Murthy Best B.Tech Project Award in CSE Dept for 2024)
    • Alan Joel (May 2023, Next position : PhD Student, UCLA)
      Thesis Title : Towards proving Lower Bounds for Span and Dependency Programs
      (Winner, Prof. C. Sivaram Murthy Best B.Tech Project Award in CSE Dept for 2023)
    • Kotagiri Venkata Nikhil (May 2021) - (Next position : Microsoft, Hyderabad)
      Thesis Title : Power of Incremental Dynamic Programing for Tree Mapping Problem
    • Allada Praharsh (May 2021) - (Next position : )
      Thesis Title : Later Rejections, Approximations, and Bounds for Dynamic Branching Programs
    • Neha Kuntewar (May 2020) - (Next position : To Be Announced)
      Thesis Title : A Study of Discerning Problem for Words and Sets
    • Janani S. (May 2020) - (Next position : PhD Student, Dept of CS, Rutgers University, USA)
      Thesis Title : Towards PLP Conjecture for Aperiodic Monoids and Generalizations to Parity Query Models
    • Prashanth Amireddy (May 2020) - (Next Position : Flipkart)
      Thesis Title : Power of Decision Trees with Monotone Queries
      (Joint-Winner, Prof. C. Sivaram Murthy Best B.Tech Project Award in CSE Dept for 2020)
    • Sai Jayasurya (May 2020) - (Next position : Google Inc.)
      Thesis Title : On the Myster of Negations in Circuits : Structure vs Power
      (Joint-Winner, Prof. C. Sivaram Murthy Best B.Tech Project Award in CSE Dept for 2020)
    • Nirmal Thomas (May 2019) - (Institute : CET, Trivandrum, Kerala, Next position : Software Engineer, Finbox, Bangalore.)
      Thesis Title : On the Rotation Distance between Binary Trees - Combinatorial Bounds
    • Ajay Krishna A. (May 2016, Next Position : SDE, Microsoft, Redmond, USA)
      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, Next position : GRA, Microsoft Gray Systems Lab, UW Madison, USA)
      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.)
  • Research Interns
    • Himika Das : May 2023 - Jul 2023 - from IISER, Tirupati
    • Area : Combinatorics of Words
    • Nikhil Goyal : May 2023 - Aug 2023 - from Thapar University
    • Area : Sorting by Reversals
    • Amala Nelson : May 2019 - Jul 2019 (via IITM SFP Program) from College of Engineering, Trivandrum, Kerala.
    • Report Title : Uniform Hypergraphic Degree Sequences
    • Amala Nelson : May 2019 - Jul 2019 (via IITM SFP Program) from College of Engineering, Trivandrum, Kerala.
    • Report Title : Uniform Hypergraphic Degree Sequences
    • R. Harisankar : May 2019 - Jul 2019 (via IITM SFP Program) from College of Engineering, Trivandrum, Kerala.
    • Report Title : Degree Sequences of Hypergraphs - Study of Realizability Characterizations
    • Neha Kuntewar : Jun 2019 - Jul 2019 (via IITM DP-SFP Program) from VNIT, Nagpur, Maharashtra.
    • Report Title : On the Seperating Words Problem
    • Nirmal Thomas : May 2018 - Jul 2018 (via IITM SFP Program) from College of Engineering, Trivandrum, Kerala.
    • Report Title : Rotation Distance : Combinatorics and Algorithms
    • Amrith M. : May 2018 - Jul 2018 (via IITM SFP Program) from College of Engineering, Trivandrum. Kerala.
    • Report Title : On the 2NFA vs 2DFA problem
    • Pranjal Dutta : May 2016 - Jul 2016 (via Microsoft SFP Program) from Chennai Mathematical Institute (CMI), Chennai.
    • Report Title : Newton Polygons and Arithmetic Circuit Complexity

  • Last update: Sun Jun 16 07:46:31 IST 2019.