Jayalal Sarma

99 papers A 4B 6C 5Misc 10Journal 62Unranked 12
YearRankTypeTitle / Venue / Authors
2026 J jnl
On Condensation of Block Sensitivity, Certificate Complexity and the AND (and OR) Decision Tree Complexity.
CoRR
Sai Soumya Nalli, Karthikeya Polisetty, Jayalal Sarma
2026 C conf
On the Reachability Problem on Monoid-Labelled Undirected Graphs.
RAMICS
Nagashri Krishnakumar, Harshil Mittal, Jayalal Sarma
2025 — conf
Almost-Catalytic Computation.
CIAC (2)
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma
2025 A conf
Avoiding Range via Turan-Type Bounds.
APPROX/RANDOM
Neha Kuntewar, Jayalal Sarma
2025 J jnl
Hazard-free Decision Trees.
CoRR
Deepu Benson, Balagopal Komarath, Jayalal Sarma, Nalli Sai Soumya
2025 B conf
On Saving Energy in Boolean Circuits via Negations.
FCT
Jayalal Sarma, Kei Uchizawa
2025 J jnl
Range Avoidance in Boolean Circuits via Turan-type Bounds.
CoRR
Neha Kuntewar, Jayalal Sarma
2025 J jnl
Range Avoidance in Boolean Circuits via Turan-type Bounds.
Electron. Colloquium Comput. Complex.
Neha Kuntewar, Jayalal Sarma
2025 B conf
Sensitivity and Query Complexity Under Uncertainty.
MFCS
Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah
2025 J jnl
Sensitivity and Query Complexity under Uncertainty.
CoRR
Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah
2025 B conf
Shallow-Rotation Distance via Forest Representations.
FCT
S. K. M. Anoop, Jayalal Sarma
2024 J jnl
Almost-catalytic Computation.
CoRR
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma
2024 J jnl
Almost-catalytic Computation.
Electron. Colloquium Comput. Complex.
Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma
2024 C conf
Energy and Output Patterns in Boolean Circuits.
TAMC
Jayalal Sarma, Kei Uchizawa
2024 J jnl
On Rotation Distance of Rank Bounded Trees.
Fundam. Informaticae
S. K. M. Anoop, Jayalal Sarma
2023 J jnl
On Rotation Distance of Rank Bounded Trees.
CoRR
S. K. M. Anoop, Jayalal Sarma
2023 J jnl
Power of Decision Trees with Monotone Queries.
CoRR
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
2023 — conf
Separating Words Problem over Groups.
DCFS
Neha Kuntewar, S. K. M. Anoop, Jayalal Sarma
2022 J jnl
Isomorphism testing of read-once functions and polynomials.
Inf. Comput.
B. V. Raghavendra Rao, Jayalal Sarma
2022 J jnl
On pure space vs catalytic space.
Theor. Comput. Sci.
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
2022 J jnl
Power of Decision Trees with Monotone Queries.
Electron. Colloquium Comput. Complex.
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
2022 Misc conf
Rotation Distance for Rank Bounded Trees.
COCOON
S. K. M. Anoop, Jayalal Sarma
2021 C conf
On the Computational Power of Programs over BA
LATA
Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan
2020 J jnl
New bounds for energy complexity of Boolean functions.
Theor. Comput. Sci.
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2020 C conf
On Pure Space vs Catalytic Space.
TAMC
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
2020 Misc conf
On the Mystery of Negations in Circuits: Structure vs Power.
COCOON
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
2020 Misc conf
Power of Decision Trees with Monotone Queries.
COCOON
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
2020 J jnl
Sensitivity, affine transforms and quantum communication complexity.
Theor. Comput. Sci.
Krishnamoorthy Dinesh, Jayalal Sarma
2019 J jnl
Alternation, sparsity and sensitivity: Bounds and exponential gaps.
Theor. Comput. Sci.
Krishnamoorthy Dinesh, Jayalal Sarma
2019 J jnl
Characterization and Lower Bounds for Branching Program Size using Projective Dimension.
ACM Trans. Comput. Theory
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
2019 Misc conf
Sensitivity, Affine Transforms and Quantum Communication Complexity.
COCOON
Krishnamoorthy Dinesh, Jayalal Sarma
2019 J jnl
Space complexity of reachability testing in labelled graphs.
J. Comput. Syst. Sci.
Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil
2018 — conf
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps.
CALDAM
Krishnamoorthy Dinesh, Jayalal Sarma
2018 J jnl
Comparator Circuits over Finite Bounded Posets.
Inf. Comput.
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2018 Misc conf
New Bounds for Energy Complexity of Boolean Functions.
COCOON
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2018 J jnl
New Bounds for Energy Complexity of Boolean Functions.
CoRR
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2018 J jnl
New Bounds for Energy Complexity of Boolean Functions.
Electron. Colloquium Comput. Complex.
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
2018 J jnl
Pebbling meets coloring: Reversible pebble game on trees.
J. Comput. Syst. Sci.
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
2018 J jnl
Sensitivity, Affine Transforms and Quantum Communication Complexity.
CoRR
Krishnamoorthy Dinesh, Jayalal Sarma
2018 J jnl
Sensitivity, Affine Transforms and Quantum Communication Complexity.
Electron. Colloquium Comput. Complex.
Krishnamoorthy Dinesh, Jayalal Sarma
2017 J jnl
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps.
CoRR
Krishnamoorthy Dinesh, Jayalal Sarma
2017 J jnl
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps.
Electron. Colloquium Comput. Complex.
Krishnamoorthy Dinesh, Jayalal Sarma
2017 J jnl
Depth Lower Bounds against Circuits with Sparse Orientation.
Fundam. Informaticae
Sajin Koroth, Jayalal Sarma
2017 J jnl
Min/Max-Poly Weighting Schemes and the NL versus UL Problem.
ACM Trans. Comput. Theory
Anant Dhayal, Jayalal Sarma, Saurabh Sawlani
2017 J jnl
On the Complexity of L-reachability.
CoRR
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2017 C conf
Space Complexity of Reachability Testing in Labelled Graphs.
LATA
Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil
2017 B conf
Testing Polynomial Equivalence by Scaling Matrices.
FCT
Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma
2016 J jnl
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices.
ACM Trans. Comput. Theory
Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
2016 — conf
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.
FSTTCS
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
2016 J jnl
Characterization and Lower Bounds for Branching Program Size using Projective Dimension.
CoRR
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
2016 J jnl
Characterization and Lower Bounds for Branching Program Size using Projective Dimension.
Electron. Colloquium Comput. Complex.
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
2016 J jnl
On the Complexity of L-reachability.
Fundam. Informaticae
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2016 J jnl
Pebbling Meets Coloring : Reversible Pebble Game On Trees.
Electron. Colloquium Comput. Complex.
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
2016 J jnl
Pebbling Meets Coloring: Reversible Pebble Game On Trees.
CoRR
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
2015 — conf
Comparator Circuits over Finite Bounded Posets.
ICALP (1)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2015 J jnl
Comparator Circuits over Finite Bounded Posets.
CoRR
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2015 J jnl
Comparator Circuits over Finite Bounded Posets.
Electron. Colloquium Comput. Complex.
K. S. Sunil, Balagopal Komarath, Jayalal Sarma
2015 J jnl
Pebbling, Entropy, and Branching Program Size Lower Bounds.
ACM Trans. Comput. Theory
Balagopal Komarath, Jayalal Sarma
2015 Misc conf
Reversible Pebble Game on Trees.
COCOON
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
2014 J jnl
Balancing Bounded Treewidth Circuits.
Theory Comput. Syst.
Maurice J. Jansen, Jayalal Sarma
2014 — conf
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.
MFCS (2)
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard
2014 J jnl
Complexity of Testing Reachability in Matroids.
Chic. J. Theor. Comput. Sci.
B. V. Raghavendra Rao, Jayalal Sarma
2014 Misc conf
Depth Lower Bounds against Circuits with Sparse Orientation.
COCOON
Sajin Koroth, Jayalal Sarma
2014 J jnl
Depth Lower Bounds against Circuits with Sparse Orientation.
CoRR
Sajin Koroth, Jayalal Sarma
2014 J jnl
Depth Lower Bounds against Circuits with Sparse Orientation.
Electron. Colloquium Comput. Complex.
Sajin Koroth, Jayalal Sarma
2014 — conf
On the Complexity of L-reachability.
DCFS
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
2014 — conf
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space.
FSTTCS
Anant Dhayal, Jayalal Sarma, Saurabh Sawlani
2014 J jnl
Using Elimination Theory to Construct Rigid Matrices.
Comput. Complex.
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
2013 J jnl
Arithmetic Circuit Lower Bounds via MaxRank
CoRR
Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
2013 — conf
Arithmetic Circuit Lower Bounds via MaxRank.
ICALP (1)
Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
2013 J jnl
Arithmetic Circuit Lower Bounds via MaxRank.
Electron. Colloquium Comput. Complex.
Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
2013 B conf
On Directed Tree Realizations of Degree Sets.
WALCOM
Prasun Kumar, Jayalal Sarma, Saurabh Sawlani
2013 J jnl
Pebbling, Entropy and Branching Program Size Lower Bounds
CoRR
Balagopal Komarath, Jayalal Sarma
2013 A conf
Pebbling, Entropy and Branching Program Size Lower Bounds.
STACS
Balagopal Komarath, Jayalal Sarma
2013 J jnl
Pebbling, Entropy and Branching Program Size Lower Bounds.
Electron. Colloquium Comput. Complex.
Balagopal Komarath, Jayalal Sarma
2012 J jnl
On Isomorphism Testing of Groups with Normal Hall Subgroups.
J. Comput. Sci. Technol.
Youming Qiao, Jayalal Sarma, Bangsheng Tang
2011 — conf
Isomorphism testing of read-once functions and polynomials.
FSTTCS
B. V. Raghavendra Rao, Jayalal Sarma
2011 A conf
On Isomorphism Testing of Groups with Normal Hall Subgroups.
STACS
Youming Qiao, Jayalal Sarma, Bangsheng Tang
2011 J jnl
On the Complexity of Matroid Isomorphism Problem.
Theory Comput. Syst.
B. V. Raghavendra Rao, Jayalal Sarma
2010 Misc conf
Balancing Bounded Treewidth Circuits.
CSR
Maurice J. Jansen, Jayalal Sarma
2010 J jnl
Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs
CoRR
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2010 — conf
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs.
FSTTCS
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2010 J jnl
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs.
Electron. Colloquium Comput. Complex.
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2010 J jnl
Deterministic Identity Testing of Read-Once Algebraic Branching Programs.
Electron. Colloquium Comput. Complex.
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2010 B conf
Limiting Negations in Bounded Treewidth and Upward Planar Circuits.
MFCS
Jing He, Hongyu Liang, Jayalal Sarma
2010 J jnl
On the Complexity of Matrix Rank and Rigidity.
Theory Comput. Syst.
Meena Mahajan, Jayalal Sarma
2009 J jnl
Balancing Bounded Treewidth Circuits
CoRR
Maurice J. Jansen, Jayalal Sarma
2009 J jnl
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
CoRR
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
2009 Misc conf
On the Complexity of Matroid Isomorphism Problems.
CSR
B. V. Raghavendra Rao, Jayalal Sarma
2009 J jnl
Upper Bounds for Monotone Planar Circuit Value and Variants.
Comput. Complex.
Nutan Limaye, Meena Mahajan, Jayalal Sarma
2009 J jnl
Using Elimination Theory to construct Rigid Matrices
CoRR
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
2009 — conf
Using Elimination Theory to construct Rigid Matrices.
FSTTCS
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
2009 J jnl
Using Elimination Theory to construct Rigid Matrices.
Electron. Colloquium Comput. Complex.
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
2008 J jnl
On the Complexity of Matroid Isomorphism Problem
CoRR
B. V. Raghavendra Rao, Jayalal Sarma
2008 J jnl
Rigidity of a simple extended lower triangular matrix.
Inf. Process. Lett.
Meena Mahajan, Jayalal Sarma
2007 Misc conf
On the Complexity of Matrix Rank and Rigidity.
CSR
Meena Mahajan, Jayalal Sarma
2006 J jnl
Evaluating Monotone Circuits on Cylinders, Planes and Tori
Electron. Colloquium Comput. Complex.
Nutan Limaye, Meena Mahajan, Jayalal Sarma
2006 A conf
Evaluating Monotone Circuits on Cylinders, Planes and Tori.
STACS
Nutan Limaye, Meena Mahajan, Jayalal Sarma
2006 J jnl
On the Complexity of Rank and Rigidity.
Electron. Colloquium Comput. Complex.
Meena Mahajan, Jayalal Sarma