## Research InterestsCircuit Complexity Theory |

#### Teaching actvities

- TA for Algorithmic Algebra - Jul-Nov, 2017
- TA for Computability and Complexity - Aug-Nov, 2016
- TA for Algorithmic Algebra - Aug-Nov, 2015
- TA for Languages, Machines and Computations - Jan-May, 2015
- TA for Algorithmic Algebra - Jul-Nov, 2014
- TA for Modern Techniques in Theory of Computation - Jan-May, 2014
- TA for Mathematical Concepts for Computer Science - Jul-Nov, 2013

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

4th Annual Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2018), Feb 2018**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