Jayalal Sarma

Cited by

	All	Since 2019
Citations	296	114
h-index	11	7
i10-index	12	3

20062007200820092010201120122013201420152016201720182019202020212022202320243 2 2 3 11 16 14 22 21 21 20 19 23 21 22 15 18 14 24

Public access

View all

2 articles

1 article

available

not available

Based on funding mandates

Co-authors

Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, IndiaVerified email at imsc.res.in
Raghavendra Rao B VIIT MadrasVerified email at cse.iitm.ac.in
Krishnamoorthy DineshIndian Institute of Technology Palakkad, IndiaVerified email at iitpkd.ac.in
Balagopal KomarathAssistant Professor, CSE, IIT GandhinagarVerified email at iitgn.ac.in
Youming QiaoUniversity of Technology SydneyVerified email at uts.edu.au
Saurabh SawlaniSoundHound AIVerified email at soundhound.com
Nutan LimayeAssociate Professor, Computer Science, IT University of Copenhagen, DenmarkVerified email at itu.dk
Bangsheng TangFacebookVerified email at fb.com
Sunil K.SAsst. Professor in Computer Science and Engineering, Govt.Engineering College IdukkiVerified email at gecidukki.ac.in
Mrinal KumarTata Institute of Fundamental Research, MumbaiVerified email at tifr.res.in
Sajin KorothUniversity of VictoriaVerified email at uvic.ca
Abhinav KumarStony Brook UniversityVerified email at stonybrook.edu
Samir OtivMaximl LabsVerified email at maximl.com
Kristoffer Arnsfelt HansenAssociate Professor, Department of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Sven SkyumReader emeritus at Department of Computer Science, University of AarhusVerified email at cs.au.dk
Navid TalebanfardUniversity of SheffieldVerified email at sheffield.ac.uk
Prashanth AmireddyHarvard UniversityVerified email at g.harvard.edu
Hongyu LiangFacebook, Inc.Verified email at mails.tsinghua.edu.cn
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyVerified email at cs.uni-saarland.de
Jing HeFacebook, IncVerified email at fb.com

Jayalal Sarma

Indian Institute of Technology Madras, Chennai, India

Verified email at cse.iitm.ac.in - Homepage

Computational Complexity Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
On isomorphism testing of groups with normal Hall subgroups YM Qiao, JS Mn, BS Tang Journal of Computer Science and Technology 27 (4), 687-701, 2012	33	2012
On the complexity of matrix rank and rigidity M Mahajan, J Sarma MN International Computer Science Symposium in Russia, 269-280, 2007	27	2007
Upper bounds for monotone planar circuit value and variants N Limaye, M Mahajan, JMN Sarma computational complexity 18 (3), 377, 2009	25	2009
Using elimination theory to construct rigid matrices A Kumar, SV Lokam, VM Patankar, MNJ Sarma Computational complexity 23, 531-563, 2014	23*	2014
Deterministic Black-Box Identity Testing -Ordered Algebraic Branching Programs M Jansen, Y Qiao, J Sarma arXiv preprint arXiv:1002.1496, 2010	23	2010
Deterministic identity testing of read-once algebraic branching programs M Jansen, Y Qiao, J Sarma arXiv preprint arXiv:0912.2565, 2009	18	2009
Evaluating monotone circuits on cylinders, planes and tori N Limaye, M Mahajan, MN Jayalal Sarma Annual Symposium on Theoretical Aspects of Computer Science, 660-671, 2006	18	2006
Pebbling meets coloring: Reversible pebble game on trees B Komarath, J Sarma, S Sawlani Journal of Computer and System Sciences 91, 33-41, 2018	13*	2018
New bounds for energy complexity of boolean functions K Dinesh, S Otiv, J Sarma Theoretical Computer Science 845, 59-75, 2020	12	2020
Balancing bounded treewidth circuits M Jansen, J Sarma Theory of Computing Systems 54, 318-336, 2014	12*	2014
Arithmetic circuit lower bounds via maximum-rank of partial derivative matrices M Kumar, G Maheshwari, J Sarma ACM Transactions on Computation Theory (TOCT) 8 (3), 1-17, 2016	11*	2016
On the Complexity of Matroid Isomorphism Problem. BVR Rao, J Sarma Theory Comput. Syst. 49 (2), 246-272, 2011	11*	2011
Alternation, sparsity and sensitivity: Bounds and exponential gaps K Dinesh, J Sarma Theoretical Computer Science 771, 71-82, 2019	9*	2019
Isomorphism testing of read-once functions and polynomials RBV Raghavendra, SMN Jayalal Information and Computation 285, 104921, 2022	8*	2022
Depth lower bounds against circuits with sparse orientation S Koroth, J Sarma Fundamenta Informaticae 152 (2), 123-144, 2017	8	2017
On pure space vs catalytic space S Bisoyi, K Dinesh, J Sarma Theoretical Computer Science 921, 112-126, 2022	7	2022
Pebbling, entropy, and branching program size lower bounds B Komarath, J Sarma ACM Transactions on Computation Theory (TOCT) 7 (2), 1-21, 2015	5	2015
Testing polynomial equivalence by scaling matrices M Bläser, BVR Rao, J Sarma International Symposium on Fundamentals of Computation Theory, 111-122, 2017	4	2017
On the Complexity of L-reachability B Komarath, J Sarma, KS Sunil Fundamenta Informaticae 145 (4), 471-483, 2016	4	2016
Circuit complexity of properties of graphs with constant planar cutwidth KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard Mathematical Foundations of Computer Science 2014: 39th International …, 2014	4	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors