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 InterestsCircuit Complexity TheoryMoved to:PhD Student, Princeton University, USA |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Computability and Complexity - Aug-Nov, 2016
Publications (while with the group, last 10)
See here for all publications while at IITM
- Space Complexity of Labelled Graph Reachability Problem
Authors: V. Ramaswamy, Jayalal Sarma, K.S. Sunil
Journal of Computer and System Sciences, Jun 2019 - Space Complexity of Labelled Graph Reachability Problem
Authors: V. Ramaswamy, Jayalal Sarma, K.S. Sunil
11th International Conference on Language and Automata Theory and Applications (LATA 2017), Mar 2017