Research Publications -@ CSE-IITM

Publications by the members of CSE Department :

Page: 1 of 2 » Prev 1 2 Next page : items per page :

Filters Type : Member : Area : Lab:

Energy and Output Patterns in Boolean Circuits.

Jayalal Sarma, Kei Uchizawa
Appeared in Theory and Applications of Models of Computation - 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings (TAMC 2024), Lecture Notes in Computer Science, Vol 14637, pp.185-196, May 2024.

On Rotation Distance of Rank Bounded Trees.

S. K. M. Anoop, Jayalal Sarma
Appeared in Fundam. Informaticae, Vol 191, No., pp.79-104, 2024.

Separating Words Problem over Groups.

Neha Kuntewar, S. K. M. Anoop, Jayalal Sarma
Appeared in Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings (DCFS 2023), Lecture Notes in Computer Science, Vol 13918, pp.109-120, Jul 2023.

Rotation Distance for Rank Bounded Trees.

S. K. M. Anoop, Jayalal Sarma
Appeared in Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings (COCOON 2022), Lecture Notes in Computer Science, Vol 13595, pp.529-536, Oct 2022.

Power of Decision Trees with Monotone Queries.

Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
Appeared in Electron. Colloquium Comput. Complex. (TR22), 2022.

Isomorphism testing of read-once functions and polynomials.

B. V. Raghavendra Rao, Jayalal Sarma
Appeared in Inf. Comput., Vol 285, pp.104921, 2022.

On pure space vs catalytic space.

Sagar Bisoyi, Krishnamoorthy Dinesh , Jayalal Sarma
Appeared in Theor. Comput. Sci., Vol 921, pp.112-126, 2022.

On the Computational Power of Programs over BA2Monoid.

Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan
Appeared in Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings (LATA 2021), Lecture Notes in Computer Science, Vol 12638, pp.29-40, Mar 2021.

On Pure Space vs Catalytic Space.

Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
Appeared in Theory and Applications of Models of Computation, 16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings. (TAMC 2020), Lecture Notes in Computer Science, Vol 12337, pp.439-451, Oct 2020.

On the Mystery of Negations in Circuits: Structure vs Power.

Amireddy Prashanth Reddy, S Sai Jayasurya, Jayalal Sarma
Appeared in Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings (COCOON 2020), Lecture Notes in Computer Science, Vol 12273, pp.566-577, Aug 2020.

Power of Decision Trees with Monotone Queries.

Amireddy Prashanth Reddy, S Sai Jayasurya, Jayalal Sarma
Appeared in Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings (COCOON 2020), Lecture Notes in Computer Science, Vol 12273, pp.287-298, Aug 2020.

New bounds for energy complexity of Boolean functions.

Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
Appeared in Theor. Comput. Sci., Vol 845, pp.59-75, 2020.

Sensitivity, affine transforms and quantum communication complexity.

Krishnamoorthy Dinesh 0001, Jayalal Sarma
Appeared in Theor. Comput. Sci., Vol 838, pp.68-80, 2020.

Sensitivity, Affine Transforms and Quantum Communication Complexity.

Krishnamoorthy Dinesh, Jayalal Sarma
Appeared in Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings (COCOON 2019), Lecture Notes in Computer Science, Vol 11653, pp.140-152, Jul 2019.

Alternation, sparsity and sensitivity: Bounds and exponential gaps.

Krishnamoorthy Dinesh, Jayalal Sarma
Appeared in Theor. Comput. Sci., Vol 771, pp.71-82, 2019.

Characterization and Lower Bounds for Branching Program Size using Projective Dimension.

Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Appeared in TOCT, Vol 11, pp.8:1-8:22, 2019.

Space complexity of reachability testing in labelled graphs.

Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil
Appeared in J. Comput. Syst. Sci., Vol 105, pp.40-53, 2019.

New Bounds for Energy Complexity of Boolean Functions.

Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
Appeared in Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings (COCOON 2018), Lecture Notes in Computer Science, Vol 10976, pp.738-750, Jul 2018.

Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps.

Krishnamoorthy Dinesh, Jayalal Sarma
Appeared in Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings (CALDAM 2018), Lecture Notes in Computer Science, Vol 10743, pp.260-273, Feb 2018.

New Bounds for Energy Complexity of Boolean Functions.

Krishnamoorthy Dinesh , Samir Otiv, Jayalal Sarma
Appeared in Electron. Colloquium Comput. Complex. (TR18), 2018.

Sensitivity, Affine Transforms and Quantum Communication Complexity.

Krishnamoorthy Dinesh , Jayalal Sarma
Appeared in Electron. Colloquium Comput. Complex. (TR18), 2018.

Comparator Circuits over Finite Bounded Posets.

Balagopal Komarath, Jayalal Sarma, K. S. Sunil
Appeared in Inf. Comput., Vol 261, pp.160-174, 2018.

Pebbling meets coloring: Reversible pebble game on trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Appeared in J. Comput. Syst. Sci., Vol 91, pp.33-41, 2018.

Testing Polynomial Equivalence by Scaling Matrices.

Markus Blser, B. V. Raghavendra Rao, Jayalal Sarma
Appeared in Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings (FCT 2017), Lecture Notes in Computer Science, Vol 10472, pp.111-122, Sep 2017.

Space Complexity of Reachability Testing in Labelled Graphs.

Vidhya Ramaswamy, Jayalal Sarma, Sunil.K.S
Appeared in Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Ume, Sweden, March 6-9, 2017, Proceedings (LATA 2017), Lecture Notes in Computer Science, Vol 10168, pp.351-363, Mar 2017.

Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps.

Krishnamoorthy Dinesh , Jayalal Sarma
Appeared in Electron. Colloquium Comput. Complex. (TR17), 2017.

Min/Max-Poly Weighting Schemes and the NL versus UL Problem.

Anant Dhayal, Jayalal Sarma, Saurabh Sawlani
Appeared in TOCT, Vol 9, pp.10:1-10:25, 2017.

Depth Lower Bounds against Circuits with Sparse Orientation.

Sajin Koroth, Jayalal Sarma
Appeared in Fundamamentae Informormatica (FI), Vol 152, pp.123-144, 2017.

Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.

Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Appeared in 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India (FSTTCS 2016), LIPIcs, Vol 65, pp.37:1-37:14, Dec 2016.

Characterization and Lower Bounds for Branching Program Size using Projective Dimension.

Krishnamoorthy Dinesh , Sajin Koroth, Jayalal Sarma
Appeared in Electron. Colloquium Comput. Complex. (TR16), 2016.

Pebbling Meets Coloring : Reversible Pebble Game On Trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Appeared in Electron. Colloquium Comput. Complex. (TR16), 2016.

On the Complexity of L-reachability

Balagopal Komarath, Jayalal Sarma, Sunil.K.S
Appeared in Fundam. Inform., Vol 145, pp.471-483, 2016.

Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices.

Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
Appeared in TOCT, Vol 8, pp.8, 2016.

Reversible Pebble Game on Trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Appeared in Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings (COCOON 2015), Lecture Notes in Computer Science, Vol 9198, pp.83-94, 2015.

Comparator Circuits over Finite Bounded Posets.

Balagopal Komarath, Jayalal Sarma, Sunil.K.S
Appeared in Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (ICALP 2015), Lecture Notes in Computer Science, Vol 9134, pp.834-845, Jul 2015.

Comparator Circuits over Finite Bounded Posets.

Sunil.K.S, Balagopal Komarath, Jayalal Sarma
Appeared in Electron. Colloquium Comput. Complex. (TR15), 2015.

Pebbling, Entropy, and Branching Program Size Lower Bounds.

Balagopal Komarath, Jayalal Sarma
Appeared in TOCT, Vol 7, pp.8, 2015.

Complexity of Testing Reachability in Matroids.

B. V. Raghavendra Rao, Jayalal Sarma
Appeared in Chicago J. Theor. Comput. Sci., Vol 2015, 2015.

Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space.

Anant Dhayal, Jayalal Sarma, Saurabh Sawlani
Appeared in 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India (FSTTCS 2014), LIPIcs, Vol 29, pp.597-609, 2014.

Depth Lower Bounds against Circuits with Sparse Orientation.

Sajin Koroth, Jayalal Sarma
Appeared in Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings (COCOON 2014), Lecture Notes in Computer Science, Vol 8591, pp.596-607, Aug 2014.

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.

Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard
Appeared in Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (MFCS 2014), Lecture Notes in Computer Science, Vol 8635, pp.336-347, Aug 2014.

On the Complexity of L-reachability.

Balagopal Komarath, Jayalal Sarma, Sunil.K.S
Appeared in Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings (DCFS 2014), Lecture Notes in Computer Science, Vol 8614, pp.258-269, Aug 2014.

Depth Lower Bounds against Circuits with Sparse Orientation.

Sajin Koroth, Jayalal Sarma
Appeared in Electron. Colloquium Comput. Complex. (TR14), 2014.

Using Elimination Theory to Construct Rigid Matrices.

Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Appeared in Computational Complexity, Vol 23, pp.531-563, 2014.

Balancing Bounded Treewidth Circuits.

Maurice J. Jansen, Jayalal Sarma
Appeared in Theory Comput. Syst., Vol 54, pp.318-336, 2014.

Complexity of Testing Reachability in Matroids.

B. V. Raghavendra Rao, Jayalal Sarma
Appeared in Chicago J. Theor. Comput. Sci., Vol 2014, 2014.

Arithmetic Circuit Lower Bounds via MaxRank.

Mrinal Kumar 0001, Gaurav Maheshwari, Jayalal Sarma
Appeared in Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I (ICALP 2013), Lecture Notes in Computer Science, Vol 7965, pp.661-672, Jul 2013.

On Directed Tree Realizations of Degree Sets.

Prasun Kumar, Jayalal Sarma, Saurabh Sawlani
Appeared in WALCOM: Algorithms and Computation, 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings (WALCOM 2013), Lecture Notes in Computer Science, Vol 7748, pp.274-285, Feb 2013.

Pebbling, Entropy and Branching Program Size Lower Bounds.

Balagopal Komarath, Jayalal Sarma
Appeared in 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (STACS 2013), LIPIcs, Vol 20, pp.622-633, Feb 2013.

Arithmetic Circuit Lower Bounds via MaxRank.

Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma
Appeared in Electron. Colloquium Comput. Complex. (TR13), 2013.

Page: 1 of 2 » Prev 1 2 Next page : items per page :

© 2016 - All Rights Reserved - Dept of CSE, IIT Madras

Website Credits