Get started
Author

Jayalal Sarma

Observed names: Jayalal M. N. Sarma, Jayalal Sarma M. N, Jayalal Sarma M.N., M. N. Jayalal Sarma, N, Jayalal Sarma M., Sarma Jayalal, Sarma M.N. Jayalal, Sarma M.N., Jayalal, Sarma, Jayalal, Sarma, Jayalal M. N.
ORCID: 0000-0002-4819-5711
Observed ORCID: 0000-0002-4819-5711
OpenAlex ID: A5001731932
Upper Bounds for Monotone Planar Circuit Value and Variants
2009 · Nutan Limaye, Meena Mahajan, et al. · Computational Complexity · 23
Evaluating Monotone Circuits on Cylinders, Planes and Tori
2006 · Nutan Limaye, Meena Mahajan, et al. · Lecture notes in computer science · 18
New bounds for energy complexity of Boolean functions
2020 · Krishnamoorthy Dinesh, Samir Otiv, et al. · Theoretical Computer Science · 11
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
2010 · Jansen, Maurice, Qiao, Youming, et al. · arXiv (Cornell University) · 11
PDF
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
2009 · Jansen, Maurice, Qiao, Youming, et al. · arXiv (Cornell University) · 11
PDF
On the Complexity of Matroid Isomorphism Problems
2009 · Raghavendra Rao B.V., Jayalal Sarma M.N. · Lecture notes in computer science · 10
On the Complexity of Matrix Rank and Rigidity
2007 · Meena Mahajan, Jayalal Sarma M.N. · Lecture notes in computer science · 10
On the Complexity of Matrix Rank and Rigidity
2008 · Meena Mahajan, Jayalal M. N. Sarma · Theory of Computing Systems · 7
Pebbling meets coloring: Reversible pebble game on trees
2017 · Balagopal Komarath, Jayalal Sarma, et al. · Journal of Computer and System Sciences · 6
PDF
Reversible Pebble Game on Trees
2015 · Balagopal Komarath, Jayalal Sarma, et al. · Lecture notes in computer science · 6
Arithmetic Circuit Lower Bounds via MaxRank
2013 · Mrinal Kumar, Gaurav Maheshwari, et al. · Lecture notes in computer science · 6
Balancing Bounded Treewidth Circuits
2010 · Maurice Jansen, Jayalal Sarma M.N. · Lecture notes in computer science · 6
PDF
On pure space vs catalytic space
2022 · Sagar Bisoyi, Krishnamoorthy Dinesh, et al. · Theoretical Computer Science · 5
New Bounds for Energy Complexity of Boolean Functions
2018 · Krishnamoorthy Dinesh, Samir Otiv, et al. · Lecture notes in computer science · 4
On the Complexity of L-reachability
2014 · Balagopal Komarath, Jayalal Sarma, et al. · Lecture notes in computer science · 4
Depth Lower Bounds against Circuits with Sparse Orientation
2014 · Sajin Koroth, Jayalal Sarma · Lecture notes in computer science · 3
Balancing Bounded Treewidth Circuits
2013 · Maurice Jansen, Jayalal Sarma · Theory of Computing Systems · 3
Limiting Negations in Bounded Treewidth and Upward Planar Circuits
2010 · Jing He, Hongyu Liang, et al. · Lecture notes in computer science · 3
Energy and Output Patterns in Boolean Circuits
2024 · Jayalal Sarma, Kei Uchizawa · Lecture notes in computer science · 2
Alternation, sparsity and sensitivity: Bounds and exponential gaps
2018 · Krishnamoorthy Dinesh, Jayalal Sarma · Theoretical Computer Science · 2
PDF
Comparator Circuits over Finite Bounded Posets
2018 · Balagopal Komarath, Jayalal Sarma, et al. · Information and Computation · 2
PDF
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps
2018 · Krishnamoorthy Dinesh, Jayalal Sarma · Lecture notes in computer science · 2
Depth Lower Bounds against Circuits with Sparse Orientation
2017 · Sajin Koroth, Jayalal Sarma · Fundamenta Informaticae · 2
PDF
Testing Polynomial Equivalence by Scaling Matrices
2017 · Markus Bläser, B. V. Raghavendra Rao, et al. · Lecture notes in computer science · 2
On the Complexity of L-reachability
2016 · Balagopal Komarath, Jayalal Sarma, et al. · Fundamenta Informaticae · 2
PDF
Works count: 79
Citation count: 176
H-index: 7
I10-index: 7
Year
Topic
Type