Jayalal Sarma

According to our database, Jayalal Sarma authored at least 40 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Separating Words Problem over Groups.

Neha Kuntewar, S. K. M. Anoop, Jayalal Sarma

Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022

On pure space vs catalytic space.

Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma

Theor. Comput. Sci., 2022

Isomorphism testing of read-once functions and polynomials.

B. V. Raghavendra Rao, Jayalal Sarma

Inf. Comput., 2022

Power of Decision Trees with Monotone Queries.

Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2022

Rotation Distance for Rank Bounded Trees.

S. K. M. Anoop, Jayalal Sarma

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

On the Computational Power of Programs over BA₂ Monoid.

Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan

Proceedings of the Language and Automata Theory and Applications, 2021

2020

Sensitivity, affine transforms and quantum communication complexity.

Krishnamoorthy Dinesh, Jayalal Sarma

Theor. Comput. Sci., 2020

New bounds for energy complexity of Boolean functions.

Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma

Theor. Comput. Sci., 2020

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

Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Alternation, sparsity and sensitivity: Bounds and exponential gaps.

Krishnamoorthy Dinesh, Jayalal Sarma

Theor. Comput. Sci., 2019

Space complexity of reachability testing in labelled graphs.

Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil

J. Comput. Syst. Sci., 2019

2018

Pebbling meets coloring: Reversible pebble game on trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

J. Comput. Syst. Sci., 2018

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

Krishnamoorthy Dinesh, Jayalal Sarma

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

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

Anant Dhayal, Jayalal Sarma, Saurabh Sawlani

ACM Trans. Comput. Theory, 2017

Depth Lower Bounds against Circuits with Sparse Orientation.

Sajin Koroth, Jayalal Sarma

Fundam. Informaticae, 2017

Testing Polynomial Equivalence by Scaling Matrices.

Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

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

Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma

ACM Trans. Comput. Theory, 2016

On the Complexity of L-reachability.

Balagopal Komarath, Jayalal Sarma, K. S. Sunil

Fundam. Informaticae, 2016

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

Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2016

2015

Comparator Circuits over Finite Bounded Posets.

K. S. Sunil, Balagopal Komarath, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2015

Reversible Pebble Game on Trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Balancing Bounded Treewidth Circuits.

Maurice J. Jansen, Jayalal Sarma

Theory Comput. Syst., 2014

Complexity of Testing Reachability in Matroids.

B. V. Raghavendra Rao, Jayalal Sarma

Chic. J. Theor. Comput. Sci., 2014

Using Elimination Theory to Construct Rigid Matrices.

Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma

Comput. Complex., 2014

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.

Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

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

Anant Dhayal, Jayalal Sarma, Saurabh Sawlani

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Arithmetic Circuit Lower Bounds via MaxRank.

Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2013

Pebbling, Entropy and Branching Program Size Lower Bounds.

Balagopal Komarath, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2013

On Directed Tree Realizations of Degree Sets.

Prasun Kumar, Jayalal Sarma, Saurabh Sawlani

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012

On Isomorphism Testing of Groups with Normal Hall Subgroups.

Youming Qiao, Jayalal Sarma, Bangsheng Tang

J. Comput. Sci. Technol., 2012

2011

On the Complexity of Matroid Isomorphism Problem.

B. V. Raghavendra Rao, Jayalal Sarma

Theory Comput. Syst., 2011

2010

On the Complexity of Matrix Rank and Rigidity.

Meena Mahajan, Jayalal Sarma

Theory Comput. Syst., 2010

Deterministic Identity Testing of Read-Once Algebraic Branching Programs.

Maurice J. Jansen, Youming Qiao, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2010

Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs.

Maurice J. Jansen, Youming Qiao, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2010

Limiting Negations in Bounded Treewidth and Upward Planar Circuits.

Jing He, Hongyu Liang, Jayalal Sarma

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Upper Bounds for Monotone Planar Circuit Value and Variants.

Nutan Limaye, Meena Mahajan, Jayalal Sarma

Comput. Complex., 2009

On the Complexity of Matroid Isomorphism Problems.

B. V. Raghavendra Rao, Jayalal Sarma

Proceedings of the Computer Science, 2009

2008

Rigidity of a simple extended lower triangular matrix.

Meena Mahajan, Jayalal Sarma

Inf. Process. Lett., 2008

2006

On the Complexity of Rank and Rigidity.

Meena Mahajan, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2006

Evaluating Monotone Circuits on Cylinders, Planes and Tori

Nutan Limaye, Meena Mahajan, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2006