Jayalal Sarma

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 46

Top Topics

Boolean Functions

Space Complexity

Top Venues

Electron. Colloquium Comput. Complex.

Theor. Comput. Sci.

Publications

Jayalal Sarma, Kei Uchizawa
Energy and Output Patterns in Boolean Circuits. TAMC (2024)
S. K. M. Anoop, Jayalal Sarma
On Rotation Distance of Rank Bounded Trees. Fundam. Informaticae 191 (2) (2024)
S. K. M. Anoop, Jayalal Sarma
On Rotation Distance of Rank Bounded Trees. CoRR (2023)
Neha Kuntewar, S. K. M. Anoop, Jayalal Sarma
Separating Words Problem over Groups. DCFS (2023)
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
Power of Decision Trees with Monotone Queries. CoRR (2023)
B. V. Raghavendra Rao, Jayalal Sarma
Isomorphism testing of read-once functions and polynomials. Inf. Comput. 285 (Part) (2022)
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
On pure space vs catalytic space. Theor. Comput. Sci. 921 (2022)
S. K. M. Anoop, Jayalal Sarma
Rotation Distance for Rank Bounded Trees. COCOON (2022)
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
Power of Decision Trees with Monotone Queries. Electron. Colloquium Comput. Complex. (2022)
Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan
Monoid. LATA (2021)
Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma
On Pure Space vs Catalytic Space. TAMC (2020)
Krishnamoorthy Dinesh, Jayalal Sarma
Sensitivity, affine transforms and quantum communication complexity. Theor. Comput. Sci. 838 (2020)
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
Power of Decision Trees with Monotone Queries. COCOON (2020)
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
New bounds for energy complexity of Boolean functions. Theor. Comput. Sci. 845 (2020)
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
On the Mystery of Negations in Circuits: Structure vs Power. COCOON (2020)
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. ACM Trans. Comput. Theory 11 (2) (2019)
Krishnamoorthy Dinesh, Jayalal Sarma
Sensitivity, Affine Transforms and Quantum Communication Complexity. COCOON (2019)
Krishnamoorthy Dinesh, Jayalal Sarma
Alternation, sparsity and sensitivity: Bounds and exponential gaps. Theor. Comput. Sci. 771 (2019)
Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil
Space complexity of reachability testing in labelled graphs. J. Comput. Syst. Sci. 105 (2019)
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
New Bounds for Energy Complexity of Boolean Functions. COCOON (2018)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
Comparator Circuits over Finite Bounded Posets. Inf. Comput. 261 (2018)
Krishnamoorthy Dinesh, Jayalal Sarma
Sensitivity, Affine Transforms and Quantum Communication Complexity. CoRR (2018)
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Pebbling meets coloring: Reversible pebble game on trees. J. Comput. Syst. Sci. 91 (2018)
Krishnamoorthy Dinesh, Jayalal Sarma
Sensitivity, Affine Transforms and Quantum Communication Complexity. Electron. Colloquium Comput. Complex. 25 (2018)
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
New Bounds for Energy Complexity of Boolean Functions. Electron. Colloquium Comput. Complex. 25 (2018)
Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma
New Bounds for Energy Complexity of Boolean Functions. CoRR (2018)
Krishnamoorthy Dinesh, Jayalal Sarma
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps. CALDAM (2018)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
On the Complexity of L-reachability. CoRR (2017)
Anant Dhayal, Jayalal Sarma, Saurabh Sawlani
Min/Max-Poly Weighting Schemes and the NL versus UL Problem. ACM Trans. Comput. Theory 9 (2) (2017)
Krishnamoorthy Dinesh, Jayalal Sarma
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps. Electron. Colloquium Comput. Complex. 24 (2017)
Krishnamoorthy Dinesh, Jayalal Sarma
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps. CoRR (2017)
Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma
Testing Polynomial Equivalence by Scaling Matrices. FCT (2017)
Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil
Space Complexity of Reachability Testing in Labelled Graphs. LATA (2017)
Sajin Koroth, Jayalal Sarma
Depth Lower Bounds against Circuits with Sparse Orientation. Fundam. Informaticae 152 (2) (2017)
Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices. ACM Trans. Comput. Theory 8 (3) (2016)
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. Electron. Colloquium Comput. Complex. 23 (2016)
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Pebbling Meets Coloring: Reversible Pebble Game On Trees. CoRR (2016)
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. CoRR (2016)
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Pebbling Meets Coloring : Reversible Pebble Game On Trees. Electron. Colloquium Comput. Complex. 23 (2016)
Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. FSTTCS (2016)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
On the Complexity of L-reachability. Fundam. Informaticae 145 (4) (2016)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
Comparator Circuits over Finite Bounded Posets. ICALP (1) (2015)
Balagopal Komarath, Jayalal Sarma
Pebbling, Entropy, and Branching Program Size Lower Bounds. ACM Trans. Comput. Theory 7 (2) (2015)
K. S. Sunil, Balagopal Komarath, Jayalal Sarma
Comparator Circuits over Finite Bounded Posets. Electron. Colloquium Comput. Complex. 22 (2015)
Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
Reversible Pebble Game on Trees. COCOON (2015)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
Comparator Circuits over Finite Bounded Posets. CoRR (2015)
Sajin Koroth, Jayalal Sarma
Depth Lower Bounds against Circuits with Sparse Orientation. CoRR (2014)
Balagopal Komarath, Jayalal Sarma, K. S. Sunil
On the Complexity of L-reachability. DCFS (2014)
Maurice J. Jansen, Jayalal Sarma
Balancing Bounded Treewidth Circuits. Theory Comput. Syst. 54 (2) (2014)
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Using Elimination Theory to Construct Rigid Matrices. Comput. Complex. 23 (4) (2014)
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) (2014)
Sajin Koroth, Jayalal Sarma
Depth Lower Bounds against Circuits with Sparse Orientation. COCOON (2014)
Anant Dhayal, Jayalal Sarma, Saurabh Sawlani
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. FSTTCS (2014)
Sajin Koroth, Jayalal Sarma
Depth Lower Bounds against Circuits with Sparse Orientation. Electron. Colloquium Comput. Complex. 21 (2014)
B. V. Raghavendra Rao, Jayalal Sarma
Complexity of Testing Reachability in Matroids. Chic. J. Theor. Comput. Sci. 2014 (2014)
Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
Arithmetic Circuit Lower Bounds via MaxRank. ICALP (1) (2013)
Balagopal Komarath, Jayalal Sarma
Pebbling, Entropy and Branching Program Size Lower Bounds. Electron. Colloquium Comput. Complex. 20 (2013)
Balagopal Komarath, Jayalal Sarma
Pebbling, Entropy and Branching Program Size Lower Bounds. STACS (2013)
Balagopal Komarath, Jayalal Sarma
Pebbling, Entropy and Branching Program Size Lower Bounds CoRR (2013)
Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
Arithmetic Circuit Lower Bounds via MaxRank CoRR (2013)
Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
Arithmetic Circuit Lower Bounds via MaxRank. Electron. Colloquium Comput. Complex. 20 (2013)
Prasun Kumar, Jayalal Sarma, Saurabh Sawlani
On Directed Tree Realizations of Degree Sets. WALCOM (2013)
Youming Qiao, Jayalal Sarma, Bangsheng Tang
On Isomorphism Testing of Groups with Normal Hall Subgroups. J. Comput. Sci. Technol. 27 (4) (2012)
Youming Qiao, Jayalal Sarma, Bangsheng Tang
On Isomorphism Testing of Groups with Normal Hall Subgroups. STACS (2011)
B. V. Raghavendra Rao, Jayalal Sarma
Isomorphism testing of read-once functions and polynomials. FSTTCS (2011)
B. V. Raghavendra Rao, Jayalal Sarma
On the Complexity of Matroid Isomorphism Problem. Theory Comput. Syst. 49 (2) (2011)
Maurice J. Jansen, Jayalal Sarma
Balancing Bounded Treewidth Circuits. CSR (2010)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 17 (2010)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs CoRR (2010)
Meena Mahajan, Jayalal Sarma
On the Complexity of Matrix Rank and Rigidity. Theory Comput. Syst. 46 (1) (2010)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 17 (2010)
Jing He, Hongyu Liang, Jayalal Sarma
Limiting Negations in Bounded Treewidth and Upward Planar Circuits. MFCS (2010)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. FSTTCS (2010)
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Using Elimination Theory to construct Rigid Matrices. Electron. Colloquium Comput. Complex. 16 (2009)
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Using Elimination Theory to construct Rigid Matrices. FSTTCS (2009)
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma
Using Elimination Theory to construct Rigid Matrices CoRR (2009)
Nutan Limaye, Meena Mahajan, Jayalal Sarma
Upper Bounds for Monotone Planar Circuit Value and Variants. Comput. Complex. 18 (3) (2009)
Maurice J. Jansen, Jayalal Sarma
Balancing Bounded Treewidth Circuits CoRR (2009)
Maurice J. Jansen, Youming Qiao, Jayalal Sarma
Deterministic Identity Testing of Read-Once Algebraic Branching Programs CoRR (2009)
B. V. Raghavendra Rao, Jayalal Sarma
On the Complexity of Matroid Isomorphism Problems. CSR (2009)
B. V. Raghavendra Rao, Jayalal Sarma
On the Complexity of Matroid Isomorphism Problem CoRR (2008)
Meena Mahajan, Jayalal Sarma
Rigidity of a simple extended lower triangular matrix. Inf. Process. Lett. 107 (5) (2008)
Meena Mahajan, Jayalal Sarma
On the Complexity of Matrix Rank and Rigidity. CSR (2007)
Nutan Limaye, Meena Mahajan, Jayalal Sarma
Evaluating Monotone Circuits on Cylinders, Planes and Tori. STACS (2006)
Nutan Limaye, Meena Mahajan, Jayalal Sarma
Evaluating Monotone Circuits on Cylinders, Planes and Tori Electron. Colloquium Comput. Complex. (009) (2006)
Meena Mahajan, Jayalal Sarma
On the Complexity of Rank and Rigidity. Electron. Colloquium Comput. Complex. 13 (100) (2006)