Profiles
Research Units
Publications
Sign Up
Faculty Login
X
30 Publications
14 Journals
Jayalal Sarma
Professor
Department of Computer Science and Engineering
jayalal@iitm.ac.in (Work)
+91-04422574357 (Work)
Follow
Publications - 30
Overview
Publications (30)
Network (5)
Publications (30)
Sort by Year (most recent)
Sort by Year (most recent)
Sort by Year (oldest first)
Sort by Most Cited
Sort by Recently Added
Sort (A-Z)
Sort (Z-A)
Journal
On the Computational Power of Programs over BA2 Monoid
Jayalal Sarma
,
Kulkarni M.S.
and
Sundaresan J.
2021 | Springer
Journal
Power of Decision Trees with Monotone Queries
Jayalal Sarma
,
Amireddy P.
and
Jayasurya S.
2020 | Springer Science and Business Media Deutschland GmbH
Journal
On Pure Space vs Catalytic Space
Jayalal Sarma
,
Bisoyi S.
and
Dinesh K.
2020 | Springer
Other
Sensitivity, affine transforms and quantum communication complexity
Jayalal Sarma
and
Krishnamoorthy Dinesh
2020 | Elsevier BV
Download
PDF
Postprint
Journal
On the Mystery of Negations in Circuits: Structure vs Power
Jayalal Sarma
,
Amireddy P.
and
Jayasurya S.
2020 | Springer Science and Business Media Deutschland GmbH
Articles
Space complexity of reachability testing in labelled graphs
Vidhya Ramaswamy
,
Jayalal Sarma
and
K. S. Sunil
2019 | Academic Press Inc.
Articles
Open Access
Alternation, sparsity and sensitivity: Bounds and exponential gaps
Krishnamoorthy Dinesh
and
Jayalal Sarma
2019 | Elsevier B.V.
Download
PDF
Preprint
Journal
Alternation, sparsity and sensitivity: Combinatorial bounds and exponential gaps
Jayalal Sarma
and
Dinesh K.
2018 | Springer Verlag
Other
Pebbling meets coloring: Reversible pebble game on trees
Jayalal Sarma
,
Komarath Balagopal
and
Saurabh Saxena
2018 | Elsevier BV
Download
PDF
Postprint
Other
New Bounds for Energy Complexity of Boolean Functions
Jayalal Sarma
,
Otiv Samir
and
Krishnamoorthy Dinesh
2018 | Springer International Publishing
Conferences
Testing polynomial equivalence by scaling matrices
B. V. Raghavendra Rao
and
Jayalal Sarma
2017 | Springer Verlag
Articles
Min/Max-Poly Weighting Schemes and the NL versus UL Problem
Jayalal Sarma
2017 | Association for Computing Machinery
Articles
Open Access
Depth Lower Bounds against Circuits with Sparse Orientation
Jayalal Sarma
2017 | IOS Press
Download
PDF
Preprint
Articles
Arithmetic circuit lower bounds via maximum-rank of partial derivative matrices
Gaurav Maheshwari
and
Jayalal Sarma
2016 | Association for Computing Machinery
Conferences
Characterization and lower bounds for branching program size using projective dimension
Krishnamoorthy Dinesh
and
Jayalal Sarma
2016 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Open Access
On the complexity of l-reachability
Jayalal Sarma
and
K. S. Sunil
2016 | IOS Press
Download
PDF
Preprint
Conferences
Reversible pebble game on trees
Jayalal Sarma
2015 | Springer Verlag
Conferences
Open Access
Comparator circuits over finite bounded posets
Jayalal Sarma
and
K. S. Sunil
2015 | Springer Verlag
Download
PDF
Preprint
Conferences
Polynomial min/max-weighted reachability is in unambiguous log-space
Jayalal Sarma
2014 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Circuit complexity of properties of graphs with constant planar cutwidth
Jayalal Sarma
2014 | Springer Verlag
Showing 1-20 of 30 results
prev
1
2
next
Get all the updates from Jayalal Sarma
Follow