Jayalal Sarma

According to our database, Jayalal Sarma authored at least 49 papers between 2006 and 2025.

Collaborative distances:

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

2025

Hazard-free Decision Trees.

Deepu Benson, Balagopal Komarath, Jayalal Sarma, Nalli Sai Soumya

CoRR, January, 2025

Range Avoidance in Boolean Circuits via Turan-type Bounds.

Neha Kuntewar, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2025

Sensitivity and Query Complexity Under Uncertainty.

Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

On Saving Energy in Boolean Circuits via Negations.

Jayalal Sarma, Kei Uchizawa

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

Shallow-Rotation Distance via Forest Representations.

S. K. M. Anoop, Jayalal Sarma

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

Almost-Catalytic Computation.

Sagar Bisoyi, Krishnamoothy Dinesh, Bhabya Rai, Jayalal Sarma

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

Avoiding Range via Turan-Type Bounds.

Neha Kuntewar, Jayalal Sarma

Proceedings of the Approximation, 2025

2024

Almost-catalytic Computation.

Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2024

Energy and Output Patterns in Boolean Circuits.

Jayalal Sarma, Kei Uchizawa

Proceedings of the Theory and Applications of Models of Computation, 2024

2023

Separating Words Problem over Groups.

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

Proceedings of the Descriptional Complexity of Formal Systems, 2023

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

On Pure Space vs Catalytic Space.

Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma

Proceedings of the Theory and Applications of Models of Computation, 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

Power of Decision Trees with Monotone Queries.

Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma

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

2019

Sensitivity, Affine Transforms and Quantum Communication Complexity.

Krishnamoorthy Dinesh, Jayalal Sarma

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

New Bounds for Energy Complexity of Boolean Functions.

Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma

Proceedings of the Computing and Combinatorics - 24th International Conference, 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

Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps.

Krishnamoorthy Dinesh, Jayalal Sarma

Electron. Colloquium Comput. Complex., 2017

Space Complexity of Reachability Testing in Labelled Graphs.

Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil

Proceedings of the Language and Automata Theory and Applications, 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

Pebbling Meets Coloring : Reversible Pebble Game On Trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

Electron. Colloquium Comput. Complex., 2016

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

Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Comparator Circuits over Finite Bounded Posets.

Balagopal Komarath, Jayalal Sarma, K. S. Sunil

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Reversible Pebble Game on Trees.

Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani

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

2014

Complexity of Testing Reachability in Matroids.

B. V. Raghavendra Rao, Jayalal Sarma

Chic. J. Theor. Comput. Sci., 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

On the Complexity of L-reachability.

Balagopal Komarath, Jayalal Sarma, K. S. Sunil

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Depth Lower Bounds against Circuits with Sparse Orientation.

Sajin Koroth, Jayalal Sarma

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

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

Pebbling, Entropy and Branching Program Size Lower Bounds.

Balagopal Komarath, Jayalal Sarma

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Arithmetic Circuit Lower Bounds via MaxRank.

Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011

On the Complexity of Matroid Isomorphism Problem.

B. V. Raghavendra Rao, Jayalal Sarma

Theory Comput. Syst., 2011

On Isomorphism Testing of Groups with Normal Hall Subgroups.

Youming Qiao, Jayalal Sarma, Bangsheng Tang

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Isomorphism testing of read-once functions and polynomials.

B. V. Raghavendra Rao, Jayalal Sarma

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Deterministic Identity Testing of Read-Once 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

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

Maurice J. Jansen, Youming Qiao, Jayalal Sarma

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Balancing Bounded Treewidth Circuits.

Maurice J. Jansen, Jayalal Sarma

Proceedings of the Computer Science, 2010

2009

Upper Bounds for Monotone Planar Circuit Value and Variants.

Nutan Limaye, Meena Mahajan, Jayalal Sarma

Comput. Complex., 2009

Using Elimination Theory to construct Rigid Matrices.

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

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 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

2007

On the Complexity of Matrix Rank and Rigidity.

Meena Mahajan, Jayalal Sarma

Proceedings of the Computer Science, 2007

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

Proceedings of the STACS 2006, 2006