default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJayalal Sarma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]S. K. M. Anoop, Jayalal Sarma:
On Rotation Distance of Rank Bounded Trees. Fundam. Informaticae 191(2): 79-104 (2024)- [c31]Jayalal Sarma, Kei Uchizawa
:
Energy and Output Patterns in Boolean Circuits. TAMC 2024: 185-196 - [i34]Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma:
Almost-catalytic Computation. CoRR abs/2409.07208 (2024) - [i33]Sagar Bisoyi, Krishnamoorthy Dinesh, Bhabya Rai, Jayalal Sarma:
Almost-catalytic Computation. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c30]Neha Kuntewar, S. K. M. Anoop, Jayalal Sarma:
Separating Words Problem over Groups. DCFS 2023: 109-120 - [i32]Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma:
Power of Decision Trees with Monotone Queries. CoRR abs/2301.00136 (2023) - [i31]S. K. M. Anoop, Jayalal Sarma:
On Rotation Distance of Rank Bounded Trees. CoRR abs/2304.03985 (2023) - 2022
- [j22]B. V. Raghavendra Rao, Jayalal Sarma:
Isomorphism testing of read-once functions and polynomials. Inf. Comput. 285(Part): 104921 (2022) - [j21]Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma:
On pure space vs catalytic space. Theor. Comput. Sci. 921: 112-126 (2022) - [c29]S. K. M. Anoop, Jayalal Sarma:
Rotation Distance for Rank Bounded Trees. COCOON 2022: 529-536 - [i30]Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma:
Power of Decision Trees with Monotone Queries. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c28]Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan:
On the Computational Power of Programs over BA2 Monoid. LATA 2021: 29-40 - 2020
- [j20]Krishnamoorthy Dinesh, Jayalal Sarma:
Sensitivity, affine transforms and quantum communication complexity. Theor. Comput. Sci. 838: 68-80 (2020) - [j19]Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma:
New bounds for energy complexity of Boolean functions. Theor. Comput. Sci. 845: 59-75 (2020) - [c27]Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma:
Power of Decision Trees with Monotone Queries. COCOON 2020: 287-298 - [c26]Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma:
On the Mystery of Negations in Circuits: Structure vs Power. COCOON 2020: 566-577 - [c25]Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma:
On Pure Space vs Catalytic Space. TAMC 2020: 439-451
2010 – 2019
- 2019
- [j18]Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil:
Space complexity of reachability testing in labelled graphs. J. Comput. Syst. Sci. 105: 40-53 (2019) - [j17]Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, sparsity and sensitivity: Bounds and exponential gaps. Theor. Comput. Sci. 771: 71-82 (2019) - [j16]Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. ACM Trans. Comput. Theory 11(2): 8:1-8:22 (2019) - [c24]Krishnamoorthy Dinesh, Jayalal Sarma:
Sensitivity, Affine Transforms and Quantum Communication Complexity. COCOON 2019: 140-152 - 2018
- [j15]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
Comparator Circuits over Finite Bounded Posets. Inf. Comput. 261: 160-174 (2018) - [j14]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling meets coloring: Reversible pebble game on trees. J. Comput. Syst. Sci. 91: 33-41 (2018) - [c23]Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps. CALDAM 2018: 260-273 - [c22]Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma:
New Bounds for Energy Complexity of Boolean Functions. COCOON 2018: 738-750 - [i29]Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma:
New Bounds for Energy Complexity of Boolean Functions. CoRR abs/1808.07199 (2018) - [i28]Krishnamoorthy Dinesh, Jayalal Sarma:
Sensitivity, Affine Transforms and Quantum Communication Complexity. CoRR abs/1808.10191 (2018) - [i27]Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma:
New Bounds for Energy Complexity of Boolean Functions. Electron. Colloquium Comput. Complex. TR18 (2018) - [i26]Krishnamoorthy Dinesh, Jayalal Sarma:
Sensitivity, Affine Transforms and Quantum Communication Complexity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j13]Sajin Koroth, Jayalal Sarma:
Depth Lower Bounds against Circuits with Sparse Orientation. Fundam. Informaticae 152(2): 123-144 (2017) - [j12]Anant Dhayal, Jayalal Sarma, Saurabh Sawlani:
Min/Max-Poly Weighting Schemes and the NL versus UL Problem. ACM Trans. Comput. Theory 9(2): 10:1-10:25 (2017) - [c21]Markus Bläser, B. V. Raghavendra Rao, Jayalal Sarma:
Testing Polynomial Equivalence by Scaling Matrices. FCT 2017: 111-122 - [c20]Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil:
Space Complexity of Reachability Testing in Labelled Graphs. LATA 2017: 351-363 - [i25]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
On the Complexity of L-reachability. CoRR abs/1701.03255 (2017) - [i24]Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps. CoRR abs/1712.05735 (2017) - [i23]Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j11]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
On the Complexity of L-reachability. Fundam. Informaticae 145(4): 471-483 (2016) - [j10]Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices. ACM Trans. Comput. Theory 8(3): 8:1-8:17 (2016) - [c19]Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. FSTTCS 2016: 37:1-37:14 - [i22]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling Meets Coloring: Reversible Pebble Game On Trees. CoRR abs/1604.05510 (2016) - [i21]Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. CoRR abs/1604.07200 (2016) - [i20]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling Meets Coloring : Reversible Pebble Game On Trees. Electron. Colloquium Comput. Complex. TR16 (2016) - [i19]Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j9]Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy, and Branching Program Size Lower Bounds. ACM Trans. Comput. Theory 7(2): 8:1-8:21 (2015) - [c18]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Reversible Pebble Game on Trees. COCOON 2015: 83-94 - [c17]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
Comparator Circuits over Finite Bounded Posets. ICALP (1) 2015: 834-845 - [i18]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
Comparator Circuits over Finite Bounded Posets. CoRR abs/1503.00275 (2015) - [i17]K. S. Sunil, Balagopal Komarath, Jayalal Sarma:
Comparator Circuits over Finite Bounded Posets. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j8]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to Construct Rigid Matrices. Comput. Complex. 23(4): 531-563 (2014) - [j7]B. V. Raghavendra Rao, Jayalal Sarma:
Complexity of Testing Reachability in Matroids. Chic. J. Theor. Comput. Sci. 2014 (2014) - [j6]Maurice J. Jansen, Jayalal Sarma:
Balancing Bounded Treewidth Circuits. Theory Comput. Syst. 54(2): 318-336 (2014) - [c16]Sajin Koroth, Jayalal Sarma:
Depth Lower Bounds against Circuits with Sparse Orientation. COCOON 2014: 596-607 - [c15]Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
On the Complexity of L-reachability. DCFS 2014: 258-269 - [c14]Anant Dhayal, Jayalal Sarma, Saurabh Sawlani:
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. FSTTCS 2014: 597-609 - [c13]Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard:
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) 2014: 336-347 - [i16]Sajin Koroth, Jayalal Sarma:
Depth Lower Bounds against Circuits with Sparse Orientation. CoRR abs/1404.7443 (2014) - [i15]Sajin Koroth, Jayalal Sarma:
Depth Lower Bounds against Circuits with Sparse Orientation. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c12]Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via MaxRank. ICALP (1) 2013: 661-672 - [c11]Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. STACS 2013: 622-633 - [c10]Prasun Kumar, Jayalal Sarma, Saurabh Sawlani:
On Directed Tree Realizations of Degree Sets. WALCOM 2013: 274-285 - [i14]Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. CoRR abs/1301.1425 (2013) - [i13]Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via MaxRank. CoRR abs/1302.3308 (2013) - [i12]Balagopal Komarath, Jayalal Sarma:
Pebbling, Entropy and Branching Program Size Lower Bounds. Electron. Colloquium Comput. Complex. TR13 (2013) - [i11]Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
Arithmetic Circuit Lower Bounds via MaxRank. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j5]Youming Qiao, Jayalal Sarma, Bangsheng Tang:
On Isomorphism Testing of Groups with Normal Hall Subgroups. J. Comput. Sci. Technol. 27(4): 687-701 (2012) - 2011
- [j4]B. V. Raghavendra Rao, Jayalal Sarma:
On the Complexity of Matroid Isomorphism Problem. Theory Comput. Syst. 49(2): 246-272 (2011) - [c9]B. V. Raghavendra Rao, Jayalal Sarma:
Isomorphism testing of read-once functions and polynomials. FSTTCS 2011: 115-126 - [c8]Youming Qiao, Jayalal Sarma, Bangsheng Tang:
On Isomorphism Testing of Groups with Normal Hall Subgroups. STACS 2011: 567-578 - 2010
- [j3]Meena Mahajan, Jayalal Sarma:
On the Complexity of Matrix Rank and Rigidity. Theory Comput. Syst. 46(1): 9-26 (2010) - [c7]Maurice J. Jansen, Jayalal Sarma:
Balancing Bounded Treewidth Circuits. CSR 2010: 228-239 - [c6]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. FSTTCS 2010: 296-307 - [c5]Jing He, Hongyu Liang, Jayalal Sarma:
Limiting Negations in Bounded Treewidth and Upward Planar Circuits. MFCS 2010: 417-428 - [i10]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs. CoRR abs/1002.1496 (2010) - [i9]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010) - [i8]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j2]Nutan Limaye, Meena Mahajan, Jayalal Sarma:
Upper Bounds for Monotone Planar Circuit Value and Variants. Comput. Complex. 18(3): 377-412 (2009) - [c4]B. V. Raghavendra Rao, Jayalal Sarma:
On the Complexity of Matroid Isomorphism Problems. CSR 2009: 286-298 - [c3]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to construct Rigid Matrices. FSTTCS 2009: 299-310 - [i7]Maurice J. Jansen, Jayalal Sarma:
Balancing Bounded Treewidth Circuits. CoRR abs/0910.1427 (2009) - [i6]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to construct Rigid Matrices. CoRR abs/0910.5301 (2009) - [i5]Maurice J. Jansen, Youming Qiao, Jayalal Sarma:
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. CoRR abs/0912.2565 (2009) - [i4]Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to construct Rigid Matrices. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j1]Meena Mahajan, Jayalal Sarma:
Rigidity of a simple extended lower triangular matrix. Inf. Process. Lett. 107(5): 149-153 (2008) - [i3]B. V. Raghavendra Rao, Jayalal Sarma:
On the Complexity of Matroid Isomorphism Problem. CoRR abs/0811.3859 (2008) - 2007
- [c2]Meena Mahajan, Jayalal Sarma:
On the Complexity of Matrix Rank and Rigidity. CSR 2007: 269-280 - 2006
- [c1]Nutan Limaye, Meena Mahajan, Jayalal Sarma:
Evaluating Monotone Circuits on Cylinders, Planes and Tori. STACS 2006: 660-671 - [i2]Nutan Limaye, Meena Mahajan, Jayalal Sarma:
Evaluating Monotone Circuits on Cylinders, Planes and Tori. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Meena Mahajan, Jayalal Sarma:
On the Complexity of Rank and Rigidity. Electron. Colloquium Comput. Complex. TR06 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
