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

#### Current Students

##### See here for former students

- Krishnamoorthy Dinesh (Ph.D.)
- Sagar Bisoyi (M.S.)
- Vignesh Manoharan (B.Tech. (DD))

#### Teaching actvities

- 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

#### 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

**Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps**Authors: Krishnamoorthy Dinesh, Jayalal Sarma

Theoretical Computer Science, Mar 2019**Characterization and Lower Bounds for Branching Program Size using Projective Dimension**Authors: Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma

ACM Transactions on Computation Theory (To Appear), Feb 2019**Sensitivity, Affine Transforms and Quantum Communication Complexity**Authors: Krishnamoorthy Dinesh, Jayalal Sarma

Electronic Colloquium of Computational Complexity, Technical Report, Vol 2018, No.152, Aug 2018**Comparator Circuits over Finite Bounded Posets**Authors: Balagopal Komarath, Jayalal Sarma, Sunil K.S.

Information & Computation, (Special Issue for Selected Papers from ICALP 2015), Vol 261, No.2, pp.160-174, Aug 2018**New Bounds for Energy Complexity of Boolean Functions**Authors: Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma

The 24th International Computing and Combinatorics Conference (COCOON 2018), Jul 2018**Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps**Authors: Krishnamoorthy Dinesh, Jayalal Sarma

4th Annual Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2018), Feb 2018**Pebbling Meets Coloring: Reversible Pebble Game On Trees**Authors: Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

Journal of Computer and System Sciences, Vol 91, pp.33-41, Feb 2018**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**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