Vidwan-ID : 67753

Edit Profile

Academic Identity

Scopus Id 23092218300
Google Scholar Id OzXbU7kAAAAJ

Profile Links

Score criteria

Criteria	Point
Personal Details	1
Expertise Details	1
Experience Details	1
Qualification Details	1
Employee ID	0.2
Orcid ID	0.2
Researcher ID	0.2
Scopus ID	0.2
Google Scholar ID	0.2
Honours <=3< /td>	0.3
Honours >3	0.5
Project worth less than Rs.5,00,000/-	0.2
Project worth more than Rs.5,00,000/-	0.5
Membership in professional Bodies < 5	0.5
Membership in professional bodies >=5	1
No of publications <=15	1
No of publications between 15-45	2
No of publications >45	3

Vidwan Score 6.6

8 Articles

3 Awards

Prof Jayalal Sarma

Professor

Indian Institute of Technology Madras

Publications

8

Journal Articles
25

Conference
Proceedings
3

Awards
10
1
18

Citations / H-Index

88 Citations

5 h-index

53 Citations

Altmetrics

Google Scholar

Co-author Network

Expertise

Computer Science Interdisciplinary SCI

Structural and Computational Complexity theory, Circuit Complexity, Lower bounds, Derandomization.

Personal Information

Prof Jayalal Sarma

Male

Department Of Computer Science And Engineering Indian Institute Of Technology Madras

Chennai, Tamil Nadu, India - 600036

Experience

2021 - Present

Professor

Department of Computer Science and Engineering

Indian Institute of Technology Madras, Chennai
2016 - 2021

Associate Professor

Department of Computer Science and Engineering

Indian Institute of Technology Madras, Chennai
2010 - 2016

Assistant Professor

Department of Computer Science and Engineering

Indian Institute of Technology Madras, Chennai

Qualification

2008

Ph.D.

Institute of Mathematical Sciences

Honours and Awards

2018

Srimathi Marti Annapurna Gurunath Award for Excellence in Teaching

Srimathi Marti Annapurna Gurunath

2014

IIT Madras Young Faculty Recognition Award (YFRA)

IIT Madras

2010

Microsoft Outstanding Young Faculty Award

Microsoft

2018

Srimathi Marti Annapurna Gurunath Award for Excellence in Teaching

Srimathi Marti Annapurna Gurunath

2014

IIT Madras Young Faculty Recognition Award (YFRA)

IIT Madras

2010

Microsoft Outstanding Young Faculty Award

Microsoft

Read Less

Doctoral Theses Guided

2017

Non-monotonicity, projective dimension and circuit depth and size lower bounds

Indian Institute of Technology Madras,Sajin K

2017

Space complexity of labelled graph reachability problems: new characterizations and dichotomies

Indian Institute of Technology Madras,Sunil K S

2016

New circuit lower and upper bounds via combinatorial arguments

Indian Institute of Technology Madras,Balagopal

2017

Non-monotonicity, projective dimension and circuit depth and size lower bounds

Indian Institute of Technology Madras,Sajin K

2017

Space complexity of labelled graph reachability problems: new characterizations and dichotomies

Indian Institute of Technology Madras,Sunil K S

2016

New circuit lower and upper bounds via combinatorial arguments

Indian Institute of Technology Madras,Balagopal

Read Less

Vidwan-ID : 67753

Academic Identity

Profile Links

Score criteria

Vidwan Score 6.6

Prof Jayalal Sarma

Publications

Journal Articles

Conference Proceedings

Awards

Citations / H-Index

Altmetrics

Google Scholar

Co-author Network

Publications - 33 Co-author - 88

Expertise

Computer Science Interdisciplinary SCI

Structural and Computational Complexity theory, Circuit Complexity, Lower bounds, Derandomization.

Personal Information

Prof Jayalal Sarma

Experience

Professor

Associate Professor

Assistant Professor

Qualification

Ph.D.

Honours and Awards

Srimathi Marti Annapurna Gurunath Award for Excellence in Teaching

IIT Madras Young Faculty Recognition Award (YFRA)

Microsoft Outstanding Young Faculty Award

Srimathi Marti Annapurna Gurunath Award for Excellence in Teaching

IIT Madras Young Faculty Recognition Award (YFRA)

Microsoft Outstanding Young Faculty Award

Doctoral Theses Guided

Non-monotonicity, projective dimension and circuit depth and size lower bounds

Space complexity of labelled graph reachability problems: new characterizations and dichotomies

New circuit lower and upper bounds via combinatorial arguments

Non-monotonicity, projective dimension and circuit depth and size lower bounds

Space complexity of labelled graph reachability problems: new characterizations and dichotomies

New circuit lower and upper bounds via combinatorial arguments

Publications (33)

Contact Us

Conference
Proceedings