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.)
- Amit Kumar Roy (M.S.)
- Harikrishnan E. A. (M.Tech)

#### Teaching Actvities (while with the theory group - since Jan 2011)

- 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

**Power of Decision Trees with Monotone Queries**Authors: Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma

The 26th International Conference on Computing and Combinatorics (COCOON 2020), Aug 2020**On the Mystery of Negations in Circuits : Structure vs Power**Authors: Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma

The 26th International Conference on Computing and Combinatorics (COCOON 2020), Aug 2020**Sensitivity, Affine Transforms and Quantum Communication Complexity**Authors: Krishnamoorthy Dinesh, Jayalal Sarma

Theoretical Computer Science (Invited Special Issue), Jun 2020**On Pure Space vs Catalytic Space**Authors: Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma

The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), Apr 2020**Sensitivity, Affine Transforms and Quantum Communication Complexity**Authors: Krishnamoorthy Dinesh, Jayalal Sarma

25th International Computing and Combinatorics Conference (COCOON 2019), Vol 2018, No.152, Aug 2019**Space Complexity of Labelled Graph Reachability Problem**Authors: Vidhya Ramaswamy, Jayalal Sarma, K.S. Sunil

Journal of Computer and System Sciences, Jun 2019**Characterization and Lower Bounds for Branching Program Size using Projective Dimension**Authors: Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma

ACM Transactions on Computation Theory, Vol 11, No.8, Mar 2019**Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps**Authors: Krishnamoorthy Dinesh, Jayalal Sarma

Theoretical Computer Science, Mar 2019**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