(Former) Member Profile :
|
Balagopal KomarathFormer Ph.D. student.Associated with group during : Jul 2011 - Dec 2015 Advisor(s) : Jayalal Sarma Email : baluks@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 InterestsNew Circuit Lower and Upper Bounds using Combinatorial ArgumentsMoved to:Postdoc, Univesrity of Saarland, Germany |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Advanced Theory of Computation - Aug-Nov, 2015
- TA for Modern Techniques in Theory of Computation - Jan-May, 2015
- TA for Algorithmic Algebra - Jul-Nov, 2014
- TA for Advanced Complexity Theory - Jan-May, 2014
- TA for Advanced Theory of Computation - Jul-Nov, 2013
- TA for Modern Techniques in Theory of Computation - Jan-May, 2013
- TA for Advanced Theory of Computation - Jul-Nov, 2012
- TA for Languages, Machines and Computation - Jan-Apr, 2012
- TA for Mathematical Concepts for Computer Science - Aug-Nov, 2011
Publications (while with the group, last 10)
See here for all publications while at IITM
- Comparator Circuits over Finite Bounded Posets
Authors: Balagopal Komarath, Jayalal Sarma, Sunil K.S.
Information & Computation, (Special Issue for Selected Papers from ICALP 2015), Vol 261, No.2, pp.160-174, Aug 2018 - 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 - On the Complexity of L-reachability
Authors: Balagopal Komarath, Jayalal Sarma, K.S. Sunil
Fundamenta Informaticae, Mar 2016 - Reversible Pebble Game on Trees
Authors: Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
21st International Computing and Combinatorics Conference (COCOON 2015), Aug 2015 - 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 - Pebbling, Entropy and Branching Program Size Lower Bounds
Authors: Balagopal Komarath, Jayalal Sarma
ACM Transactions on Computation Theory, Dec 2014 - Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
Authors: Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard
39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Lecture Notes in Computer Science, Vol 8634, pp.336-347, Aug 2014 - 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 - Pebbling, Entropy and Branching Program Size Lower Bounds
Authors: Balagopal Komarath, Jayalal Sarma
30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics, Vol 20, pp.622-633, Feb 2013