Member Profile :
|
Jayalal SarmaProfessorEmail : jayalal@cse.iitm.ac.in Personal Webpage Phone : (+91) 44 2257 4357 |
Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
Research InterestsStructural & Computational Complexity theory, Circuit Complexity, Lower bounds, Derandomization. |
Current Students
See here for former students
- Anoop S K M (Ph.D.)
- Bhabya Deep Rai (Ph.D.)
- Nagashri K (Ph.D.)
- Neha Kuntewar (Ph.D.)
- Sutanay Bhattacharjee (Ph.D.)
- Kumaresan T M (B.Tech)
Teaching Actvities (while with the theory group - since Jan 2011)
- Design and Analysis of Algorithms - Jan-May, 2025
- Mathematical Tools for Theoretical Computer Science - Jul-Nov, 2024
- Modern Complexity Theory - Jan-Apr, 2024
- Computability and Complexity - Jul-Nov, 2023
- Computability and Complexity - Jul-Nov, 2023
- Mathematical Tools for Theoretical Computer Science - Jul-Nov, 2022
- Algorithmic Algebra - Jul-Nov, 2022
- Modern Complexity Theory - Jan-Apr, 2022
- Languages, Machines and Computation - Jan-Apr, 2022
- Computability and Complexity - Aug-Nov, 2021
- Pseudorandomness - Feb-May, 2021
- Mathematical Tools for Theoretical Computer Science - Aug-Dec, 2020
- Pseudorandomness - Jan-May, 2020
- Algorithmic Algebra - Jul-Nov, 2019
- Logic and Combinatorics for Computer Science - Jul-Nov, 2019
- Modern Complexity Theory - Jan-May, 2019
- Computability and Complexity - Jul-Nov, 2018
- Programming and Data Structures - Jul-Nov, 2018
- Advanced Data Structures & Algorithms (Section 2) - Jul-Nov, 2017
- Advanced Programming Lab - Jul-Nov, 2017
- Algorithmic Algebra - Jul-Nov, 2017
- Discrete Mathematics for Computer Science - Jan-May, 2017
- Modern Complexity Theory - Jan-May, 2017
- Logic and Combinatorics for Computer Science - Aug-Nov, 2016
- Computability and Complexity - Aug-Nov, 2016
- Langugages, Machines and Computation - Jan-Apr, 2016
- Communication Complexity (Reading Course) - Jan-Apr, 2016
- Logic and Combinatorics for Computer Science - Aug-Nov, 2015
- Algorithmic Algebra - Aug-Nov, 2015
- Advanced Complexity Theory - Jan-May, 2015
- Modern Techniques in Theory of Computation - Jan-May, 2015
- Quantum Algorithms and Quantum Complexity (Self-Study) - Jan-May, 2015
- Advanced Theory of Computation - Jul-Nov, 2014
- Languages, Machines and Computations - Jan-May, 2014
- Modern Techniques in Theory of Computation - Jan-May, 2014
- Algorithmic Algebra - Jul-Nov, 2013
- Mathematical Concepts for Computer Science - Jul-Nov, 2013
- Communication Complexity (Reading Course) - Jan-May, 2013
- Advanced Complexity Theory - Jan-May, 2013
- Advanced Theory of Computation - Jul-Nov, 2012
- Mathematical Concepts for Computer Science - Jul-Nov, 2012
- Modern Techniques in Theory of Computation - Jan-Apr, 2012
- Languages, Machines and Computation - Jan-Apr, 2012
- Advanced Complexity Theory - Jan-Apr, 2012
- Advanced Theory of Computation - Aug-Nov, 2011
- Mathematical Concepts for Computer Science - Aug-Nov, 2011
- Topics in Complexity Theory - Jan-Apr, 2011
Publications (while with the group, last 10)
See here for all publications while at IITM
- Almost-catalytic Computation
Authors: Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Deep Rai, Jayalal Sarma
14th International Conference on Algorithms and Complexity (CIAC 2025), Vol , No., Jun 2025 - Range Avoidance in Boolean Circuits via Turan-type Bounds
Authors: Neha Kuntewar, Jayalal Sarma
Electronic Collquium of Computational Complexity, Vol , No.2005-24, Mar 2025 - Hazard-free Decision Trees
Authors: Deepu Benson, Balagopal Komarath, Sai Soumya Nalli, Jayalal Sarma
(Manuscript), Vol , No., Dec 2024 - Energy and Output Patterns in Boolean Circuits
Authors: Jayalal Sarma, Kei Uchizawa
18th Annual Conference on Theory and Applications of Models of Computation (TAMC 2024), May 2024 - On Rotation Distance of Rank Bounded Trees
Authors: Anoop S K M, Jayalal Sarma
Fundamentae Informatica, Mar 2024 - On Separating Words Problem over Groups
Authors: Neha Kuntewar, Anoop S K M, Jayalal Sarma
25th International Conference on Descriptional Complexity of Formal Systems (DCFS 2023), Jul 2023 - On Rotation Distance, Transpositions and Rank Bounded Trees
Authors: Anoop S K M, Jayalal Sarma
28th International Computing and Combinatorics Conference (COCOON 2022), Oct 2022 - Isomorphism Testing of Read-once Functions and Polynomials
Authors: Raghavendra Rao B V, Jayalal Sarma
Information and Computation, Feb 2022 - On Alternation, VC-dimension and k-fold Union of Sets
Authors: Amit Kumar Roy, Jayalal Sarma
European Conference on Combinatorics, Graph Theory, and Applications (EUROCOMB 2021), Jul 2021 - On the Computational Power of Programs over BA_2 Monoid
Authors: Manasi Kulkarni, Jayalal Sarma, Janani Sundaresan
14th-15th International Conference on Language and Automata Theory and Applications (LATA 2021), Mar 2021