(Former) Member Profile :
|
K.S. SunilFormer Ph.D. student.Associated with group during : Jan 2012 - May 2017 Advisor(s) : Jayalal Sarma Email : sunsks@gmail.com Personal Webpage |
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 InterestsSpace Complexity of Labelled Graph Reachability Problems: New Characterizations and DichotomiesMoved to: |
Teaching Actvities (while with the theory group - since Jan 2011)
- 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 with the group, 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