## Research InterestsStructural & Computational Complexity theory, Circuit Complexity, Lower bounds, Derandomization. |

#### Current Students

##### See here for former students

- Krishnamoorthy Dinesh (Ph.D.)
- Madhuri R. (M.S.)
- Shom C Abraham (M.S.)
- Billa Surendra (M.Tech)
- Ameya Panse (B.Tech. (DD))
- Samir Otiv (B.Tech. (DD))
- Vidhya Ramaswamy (B.Tech. (DD))

#### Teaching actvities

- 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

#### Projects/Funding

##### Only last five listed here. See here for more.

- Algebraic and Parameterized Complexities (Funding Agency : IMPECS)
- Resource Bounds for Boolean/Arithmetic Circuits under Combinatorial and Algebraic constraints (Funding Agency : NFSG)

#### Publications (while at IITM, last 10)

##### See here for all publications while at IITM

**Testing Equivalence of Polynomials under Scaling**Authors: Markus Blaser, Raghavendra Rao B V, Jayalal Sarma

21st International Symposium on Fundamentals of Computation Theory (FCT), Sep 2017**Min/Max-Poly Weighting Schemes and the NL vs UL Problem**Authors: Anant Dhayal, Jayalal Sarma, Saurabh Sawlani

ACM Transactions on Computation Theory, Vol 9, No.10, May 2017**Comparator Circuits over Finite Bounded Posets**Authors: Balagopal Komarath, Jayalal Sarma, Sunil K.S.

Information & Computation, (Accepted), Apr 2017**Space Complexity of Labelled Graph Reachability Problem**Authors: Vidhya Ramaswamy, Jayalal Sarma, K.S. Sunil

11th International Conference on Language and Automata Theory and Applications (LATA 2017), Mar 2017**Characterization and Lower Bounds for Branching Program Size using Projective Dimension**Authors: Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma

36th International Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2016**Pebbling Meets Coloring: Reversible Pebble Game On Trees**Authors: Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

Computing Research Repository, arXiv:1604.05510, Apr 2016**Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices**Authors: Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma

ACM Transactions on Computation Theory (To Appear), Apr 2016**On the Complexity of L-reachability**Authors: Balagopal Komarath, Jayalal Sarma, K.S. Sunil

Fundamenta Informaticae, Mar 2016**Reversible Pebble Game on Trees**Authors: Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

21st International Computing and Combinatorics Conference (COCOON 2015), Aug 2015**Comparator Circuits over Finite Bounded Posets**Authors: Balagopal Komarath, Jayalal Sarma, K.S. Sunil

Proceedings of International Conference on Automata, Languages and Programming (ICALP), Jul 2015