フォロー
Jayalal Sarma
Jayalal Sarma
Indian Institute of Technology Madras, Chennai, India
確認したメール アドレス: cse.iitm.ac.in - ホームページ
タイトル
引用先
引用先
年
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
322012
On the complexity of matrix rank and rigidity
M Mahajan, J Sarma MN
International Computer Science Symposium in Russia, 269-280, 2007
262007
Upper bounds for monotone planar circuit value and variants
N Limaye, M Mahajan, JMN Sarma
computational complexity 18 (3), 377, 2009
252009
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
232010
Deterministic identity testing of read-once algebraic branching programs
M Jansen, Y Qiao, J Sarma
arXiv preprint arXiv:0912.2565, 2009
182009
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
182006
Pebbling meets coloring: Reversible pebble game on trees
B Komarath, J Sarma, S Sawlani
Journal of Computer and System Sciences 91, 33-41, 2018
12*2018
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
10*2011
New bounds for energy complexity of boolean functions
K Dinesh, S Otiv, J Sarma
Theoretical Computer Science 845, 59-75, 2020
92020
Isomorphism testing of read-once functions and polynomials
RBV Raghavendra, SMN Jayalal
Information and Computation 285, 104921, 2022
8*2022
Alternation, sparsity and sensitivity: Bounds and exponential gaps
K Dinesh, J Sarma
Theoretical Computer Science 771, 71-82, 2019
8*2019
Depth lower bounds against circuits with sparse orientation
S Koroth, J Sarma
Fundamenta Informaticae 152 (2), 123-144, 2017
82017
Pebbling, entropy, and branching program size lower bounds
B Komarath, J Sarma
ACM Transactions on Computation Theory (TOCT) 7 (2), 1-21, 2015
52015
On the Complexity of L-reachability
B Komarath, J Sarma, KS Sunil
Fundamenta Informaticae 145 (4), 471-483, 2016
42016
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
42014
Limiting negations in bounded treewidth and upward planar circuits
J He, H Liang, JMN Sarma
Mathematical Foundations of Computer Science 2010: 35th International …, 2010
42010
On pure space vs catalytic space
S Bisoyi, K Dinesh, J Sarma
Theoretical Computer Science 921, 112-126, 2022
32022
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20