Jayalal Sarma

Cited by

	All	Since 2017
Citations	252	110
h-index	9	6
i10-index	9	3

200620072008200920102011201220132014201520162017201820192020202120223 2 1 3 11 18 14 21 22 23 21 21 20 19 23 20 6

Public access

View all

2 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Meena MahajanProfessor at The Institute of Mathematical Sciences, HBNI, Chennai, IndiaVerified email at imsc.res.in
Balagopal KomarathAssistant Professor, CSE, IIT GandhinagarVerified email at iitgn.ac.in
Raghavendra Rao B VIIT MadrasVerified email at cse.iitm.ac.in
Youming QiaoUniversity of Technology SydneyVerified email at uts.edu.au
Krishnamoorthy DineshIndian Institute of Technology Palakkad, IndiaVerified email at iitpkd.ac.in
Nutan LimayeAssociate Professor, Computer Science and Engineering, Indian Institute of Technology, Bombay, IndiaVerified email at cse.iitb.ac.in
Saurabh SawlaniSoundHound Inc.Verified email at soundhound.com
Bangsheng TangFacebookVerified email at fb.com
Sajin KorothUniversity of VictoriaVerified email at uvic.ca
Abhinav KumarStony Brook UniversityVerified email at stonybrook.edu
Sunil K.SAsst. Professor in Computer Science and Engineering, Govt.Engineering College IdukkiVerified email at gecidukki.ac.in
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 TalebanfardInstitute of Mathematics of the Czech Academy of SciencesVerified email at math.cas.cz
Anant DhayalPhd Student, UC San DiegoVerified email at eng.ucsd.edu
Hongyu LiangFacebook, Inc.Verified email at mails.tsinghua.edu.cn
Jing HeFacebook, IncVerified email at fb.com
Prashanth AmireddyMicrosoft Research IndiaVerified email at microsoft.com
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyVerified email at cs.uni-saarland.de
Manasi S KulkarniAssistant Professor, Indian Institute Information Technology VadodaraVerified email at iiitvadodara.ac.in

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	27	2012
Upper bounds for monotone planar circuit value and variants N Limaye, M Mahajan, J Sarma computational complexity 18 (3), 377-412, 2009	26	2009
On the complexity of matrix rank and rigidity M Mahajan, J Sarma MN International Computer Science Symposium in Russia, 269-280, 2007	25	2007
Deterministic Black-Box Identity Testing -Ordered Algebraic Branching Programs M Jansen, Y Qiao, J Sarma arXiv preprint arXiv:1002.1496, 2010	24	2010
Using elimination theory to construct rigid matrices A Kumar, SV Lokam, VM Patankar, MN Sarma computational complexity 23 (4), 531-563, 2014	22*	2014
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, J Sarma Annual Symposium on Theoretical Aspects of Computer Science, 660-671, 2006	18	2006
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
Balancing bounded treewidth circuits M Jansen, J Sarma Theory of Computing Systems 54 (2), 318-336, 2014	10*	2014
Pebbling meets coloring: Reversible pebble game on trees B Komarath, J Sarma, S Sawlani Journal of Computer and System Sciences 91, 33-41, 2018	9*	2018
On the Complexity of Matroid Isomorphism Problem. BVR Rao, J Sarma Theory Comput. Syst. 49 (2), 246-272, 2011	9*	2011
Isomorphism testing of read-once functions and polynomials R Rao BV, J Sarma MN IARCS Annual Conference on Foundations of Software Technology and …, 2011	7	2011
Alternation, sparsity and sensitivity: Bounds and exponential gaps K Dinesh, J Sarma Theoretical Computer Science 771, 71-82, 2019	6*	2019
Depth lower bounds against circuits with sparse orientation S Koroth, J Sarma Fundamenta Informaticae 152 (2), 123-144, 2017	6	2017
New bounds for energy complexity of Boolean functions K Dinesh, S Otiv, J Sarma Theoretical Computer Science 845, 59-75, 2020	5	2020
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
Circuit complexity of properties of graphs with constant planar cutwidth KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard International Symposium on Mathematical Foundations of Computer Science, 336-347, 2014	4	2014
Limiting negations in bounded treewidth and upward planar circuits J He, H Liang, J Sarma International Symposium on Mathematical Foundations of Computer Science, 417-428, 2010	4	2010
On the Complexity of L-reachability B Komarath, J Sarma, KS Sunil Fundamenta Informaticae 145 (4), 471-483, 2016	3	2016
Rigidity of a simple extended lower triangular matrix M Mahajan, J Sarma Information processing letters 107 (5), 149-153, 2008	3	2008

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 this author

Cited by

Co-authors