Research Publications/ReportsListing last 25 publications. (View All) View/Hide Filter
- Comparator Circuits over Finite Bounded Posets
Balagopal Komarath, Jayalal Sarma, Sunil K.S., To Appear in Information & Computation, (Special Issue for Selected Papers from ICALP 2015), Vol 261, No.2, pp.160-174, Aug 2018. A preliminary version appeared in Proceedings of International Conference on Automata, Languages and Programming (ICALP), Jul 2015.
- Pebbling Meets Coloring: Reversible Pebble Game On Trees
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani, Appeared in Journal of Computer and System Sciences, Vol 91, pp.33-41, Feb 2018. A preliminary version under the title "Reversible Pebble Game on Trees" appeared in 21st International Computing and Combinatorics Conference (COCOON 2015), Aug 2015.
- On the Complexity of L-reachability
Balagopal Komarath, Jayalal Sarma, K.S. Sunil, Appeared in Fundamenta Informaticae, Mar 2016. A preliminary version appeared in 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
Balagopal Komarath, Jayalal Sarma, Appeared in ACM Transactions on Computation Theory, Dec 2014. A preliminary version appeared in 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics, Vol 20, pp.622-633, Feb 2013.
- Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard, Appeared in 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Lecture Notes in Computer Science, Vol 8634, pp.336-347, Aug 2014.