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 InterestsTowards making space-bounded non-determinism unambiguousMoved to:PhD Student, UCSD, USA |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Advanced Complexity Theory - Jan-May, 2015
- TA for Advanced Theory of Computation - Jul-Nov, 2014
- TA for Advanced Complexity Theory - 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
- 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 - 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