Theory Group

Department of Computer Science & Engineering

Indian Institute of Technology Madras

Recent News

UTokyo - IIT Madras Workshop on Theoretical Computer Science
Balagopals thesis selected for Best Doctoral Dissertation Award (AY 2015-2016) at CSE Dept
GIAN Course : Distributed Network Algorithms: Foundations and Future Directions by Gopal Pandurangan and John Augustine

Next tMeet Talk

List of upcoming speakers

Thesis Title

Non-monotonicity, Projective Dimension and Circuit Depth and Size Lower Bounds (Thesis Submitted in Mar 2017)

First Position after IITM

Postdoc, University of Haifa, Israel.

Teaching actvities

TA for Logic and Combinatorics for Computer Science - Aug-Nov, 2015
TA for Modern Techniques in Theory of Computation - Jan-May, 2015
TA for Advanced Theory of Computation - Jul-Nov, 2014
TA for Advanced Algorithms - Jan-May, 2014
TA for Algorithmic Algebra - Jul-Nov, 2013
TA for Modern Techniques in Theory of Computation - Jan-May, 2013
TA for Mathematical Concepts for Computer Science - Jul-Nov, 2012
TA for Advanced Theory of Computation - Aug-Nov, 2011
TA for Topics in Complexity Theory - Jan-Apr, 2011

Publications (while at IITM, last 10)

See here for all publications while at IITM

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
Sub-families of Baxter Permutations Based on Pattern Avoidance
Authors: Shankar Balachandran, Sajin Koroth
The 11th International Computer Science Symposium in Russia (CSR 2016), Jun 2016
Depth Lower bounds against Circuits with Sparse Orientation
Authors: Sajin Koroth, Jayalal Sarma
Proceedings of the 20th International Computing and Combinatorics Conference (COCOON 2014), Lecture Notes in Computer Science, Vol 8591, pp.596-607, Aug 2014