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 Longest Path ProblemMoved to:PhD Student, Georgia Tech, USA |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Languages, Machines and Computations - Jan-May, 2015
- TA for Mathematical Concepts for Computer Science - Jul-Nov, 2014
- TA for Languages, Machines and Computations - Jan-May, 2014
- TA for Advanced Theory of Computation - Jul-Nov, 2013
Publications (while with the group, last 10)
See here for all publications while at IITM
- Pebbling Meets Coloring: Reversible Pebble Game On Trees
Authors: Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Journal of Computer and System Sciences, Vol 91, pp.33-41, Feb 2018 - Min/Max-Poly Weighting Schemes and the NL vs UL Problem
Authors: Anant Dhayal, Jayalal Sarma, Saurabh Sawlani
ACM Transactions on Computation Theory, Vol 9, No.10, May 2017 - Reversible Pebble Game on Trees
Authors: Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
21st International Computing and Combinatorics Conference (COCOON 2015), Aug 2015 - Polynomial Min/Max-weighted Reachability is in Unambiguous Logspace
Authors: Anant Dhayal, Jayalal Sarma, Saurabh Sawlani
Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014), Dec 2014