## Thesis TitleSpace Complexity of Labelled Graph Reachability Problems: New Characterizations and Dichotomies## First Position after IITM |

#### Teaching actvities

- TA for Logic and Combinatorics for Computer Science - Aug-Nov, 2015
- TA for Languages, Machines and Computations - Jan-May, 2015
- TA for Mathematical Concepts for Computer Science - Jul-Nov, 2014
- TA for Discrete Mathematics for Computer Science - Jul-Nov, 2013
- TA for Languages, Machines and Computation - Jan-Apr, 2012

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

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

**Space Complexity of Labelled Graph Reachability Problem**Authors: Vidhya Ramaswamy, Jayalal Sarma, K.S. Sunil

Journal of Computer and System Sciences, Jun 2019**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**On the Complexity of L-reachability**Authors: Balagopal Komarath, Jayalal Sarma, K.S. Sunil

Fundamenta Informaticae, Mar 2016**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**On the Complexity of L-reachability**Authors: Balagopal Komarath, Jayalal Sarma, K.S. Sunil

16th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2014), Lecture Notes in Computer Science, Vol 8614, pp.258-269, Aug 2014