Research Interests :
Structural & Computational Complexity theory, Circuit Complexity, Lower bounds, Derandomization.Publications : (Last Five, while at IITM)DBLP | View All
- Almost-Catalytic Computation.

Authors :
Sagar Bisoyi,
Krishnamoothy Dinesh,
Bhabya Rai,
Jayalal SarmaAppeared in
Algorithms and Complexity - 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025, Proceedings, Part II (CIAC 2025) ,Lecture Notes in Computer Science, Vol 15680, No., pp.35-51, Jun 2025
- Energy and Output Patterns in Boolean Circuits.

Authors :
Jayalal Sarma,
Kei UchizawaAppeared in
Theory and Applications of Models of Computation - 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings (TAMC 2024) ,Lecture Notes in Computer Science, Vol 14637, pp.185-196, May 2024
- On Rotation Distance of Rank Bounded Trees.

Authors :
S. K. M. Anoop,
Jayalal SarmaAppeared in
Fundam. Informaticae, Vol 191, No., pp.79-104, Jan 2024
- Separating Words Problem over Groups.

Authors :
Neha Kuntewar,
S. K. M. Anoop,
Jayalal SarmaAppeared in
Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings (DCFS 2023) ,Lecture Notes in Computer Science, Vol 13918, pp.109-120, Jul 2023
- Rotation Distance for Rank Bounded Trees.

Authors :
S. K. M. Anoop,
Jayalal SarmaAppeared in
Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings (COCOON 2022) ,Lecture Notes in Computer Science, Vol 13595, pp.529-536, Oct 2022
Jul 2024 - Nov 2024 | : | - Mathematical Tools for Theoretical Computer Science (CS5130) |
Jan 2024 - May 2024 | : | - Modern Complexity Theory (CS6840) |
Jul 2023 - Nov 2023 | : | - Computability and Complexity (CS6014) |
Jan 2023 - May 2023 | : | - Introduction to Programming (CS1100) |
Jul 2022 - Nov 2022 | : | - Dual Degree Project (CS5715) |