Jayalal Sarma M. N.

From MaRDI portal
Person:475334

Available identifiers

zbMath Open sarma-m-n.jayalalMaRDI QIDQ475334

List of research outcomes





PublicationDate of PublicationType
Energy and output patterns in Boolean circuits2024-11-12Paper
On rotation distance of rank bounded trees2024-08-27Paper
Separating words problem over groups2023-08-17Paper
Rotation distance for rank bounded trees2023-08-10Paper
On pure space vs catalytic space2022-12-22Paper
On pure space vs catalytic space2022-05-23Paper
On the computational power of programs over \(\mathsf{BA}_2\) monoid2021-10-04Paper
Power of decision trees with monotone queries2021-04-21Paper
On the mystery of negations in circuits: structure vs power2021-04-21Paper
New bounds for energy complexity of Boolean functions2020-10-22Paper
Sensitivity, affine transforms and quantum communication complexity2020-09-01Paper
Sensitivity, affine transforms and quantum communication complexity2020-02-24Paper
Characterization and Lower Bounds for Branching Program Size using Projective Dimension2019-12-16Paper
Min/Max-Poly Weighting Schemes and the NL versus UL Problem2019-12-06Paper
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices2019-12-06Paper
Space complexity of reachability testing in labelled graphs2019-08-07Paper
Alternation, sparsity and sensitivity: bounds and exponential gaps2019-05-17Paper
New bounds for energy complexity of Boolean functions2018-10-04Paper
Comparator circuits over finite bounded posets2018-06-14Paper
Alternation, sparsity and sensitivity: combinatorial bounds and exponential gaps2018-06-05Paper
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.2018-04-19Paper
Depth Lower Bounds against Circuits with Sparse Orientation*2017-12-05Paper
Testing polynomial equivalence by scaling matrices2017-11-22Paper
Balancing bounded treewidth circuits2017-11-07Paper
Pebbling meets coloring: reversible pebble game on trees2017-10-11Paper
On the Complexity of L-reachability*2017-07-28Paper
Space Complexity of Reachability Testing in Labelled Graphs2017-06-01Paper
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space2017-04-25Paper
Pebbling, Entropy and Branching Program Size Lower Bounds.2017-01-30Paper
Pebbling, entropy, and branching program size lower bounds2016-10-24Paper
Reversible Pebble Game on Trees2015-10-29Paper
Comparator circuits over finite bounded posets2015-10-27Paper
Using elimination theory to construct rigid matrices2014-11-26Paper
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth2014-10-14Paper
Depth Lower Bounds against Circuits with Sparse Orientation2014-09-26Paper
https://portal.mardi4nfdi.de/entity/Q31911482014-09-24Paper
On the Complexity of L-reachability2014-08-07Paper
On isomorphism testing of groups with normal Hall subgroups2014-02-11Paper
Arithmetic Circuit Lower Bounds via MaxRank2013-08-06Paper
On Directed Tree Realizations of Degree Sets2013-04-12Paper
Using elimination theory to construct rigid matrices2012-10-24Paper
Isomorphism testing of read-once functions and polynomials2012-08-31Paper
Deterministic black-box identity testing \(\pi\)-ordered algebraic branching programs2012-08-29Paper
https://portal.mardi4nfdi.de/entity/Q31137202012-01-23Paper
On the complexity of matroid isomorphism problem2011-10-11Paper
Upper bounds for monotone planar circuit value and variants2011-02-18Paper
Limiting Negations in Bounded Treewidth and Upward Planar Circuits2010-09-03Paper
Balancing Bounded Treewidth Circuits2010-06-22Paper
Rigidity of a simple extended lower triangular matrix2010-04-19Paper
On the complexity of matrix rank and rigidity2010-03-05Paper
On the Complexity of Matroid Isomorphism Problems2009-08-18Paper
On the Complexity of Matrix Rank and Rigidity2008-06-03Paper
Evaluating Monotone Circuits on Cylinders, Planes and Tori2008-03-19Paper

Research outcomes over time

This page was built for person: Jayalal Sarma M. N.