Jump to content

Jaikumar Radhakrishnan: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
No edit summary
No edit summary
Line 27: Line 27:
'''Jaikumar Radhakrishnan''' (born 30 May 1964) is an Indian computer scientist specialising in [[combinatorics]] and [[communication complexity]]. He has served as dean of the [[Tata Institute of Fundamental Research#School of Technology and Computer Science|School of Technology and Computer Science]] at the [[Tata Institute of Fundamental Research]], [[Mumbai]], India, where he is currently a senior professor.<ref>{{cite web|title=Jaikumar Radhakrishnan|url=http://www.tcs.tifr.res.in/~jaikumar/cv.pdf|publisher=Tata Institute of Fundamental Research, Mumbai|accessdate=1 July 2013}}</ref>
'''Jaikumar Radhakrishnan''' (born 30 May 1964) is an Indian computer scientist specialising in [[combinatorics]] and [[communication complexity]]. He has served as dean of the [[Tata Institute of Fundamental Research#School of Technology and Computer Science|School of Technology and Computer Science]] at the [[Tata Institute of Fundamental Research]], [[Mumbai]], India, where he is currently a senior professor.<ref>{{cite web|title=Jaikumar Radhakrishnan|url=http://www.tcs.tifr.res.in/~jaikumar/cv.pdf|publisher=Tata Institute of Fundamental Research, Mumbai|accessdate=1 July 2013}}</ref>


He obtained his B.Tech. degree in Computer Science and Engineering from the [[Indian Institute of Technology, Kharagpur]] in 1985 and his Ph.D. in Theoretical Computer Science from [[Rutgers University]], [[NJ]], USA, in 1991 under the guidance of [[Endre Szemerédi]]. His first research paper, titled "Better Bounds for Threshold Formulas", won the [[Machtey Award]] for best student paper at the IEEE [[Symposium on Foundations of Computer Science]] (FOCS) in 1991. His areas of research include [[combinatorics]], [[probability theory]], [[information theory]], [[communication complexity]], [[computational complexity theory]], [[quantum computation]] and [[quantum information science]].
He obtained his B.Tech. degree in Computer Science and Engineering from the [[Indian Institute of Technology, Kharagpur]] in 1985 and his Ph.D. in Theoretical Computer Science from [[Rutgers University]], [[NJ]], USA, in 1991 under the guidance of [[Endre Szemerédi]]. His first research paper, titled "Better Bounds for Threshold Formulas", won the [[Machtey Award]] for best student paper at the IEEE [[Symposium on Foundations of Computer Science]] (FOCS) in 1991. His areas of research include [[combinatorics]], [[graph theory]], [[probability theory]], [[information theory]], [[communication complexity]], [[computational complexity theory]], [[quantum computation]] and [[quantum information science]].


He was awarded the [[Shanti Swarup Bhatnagar Prize for Science and Technology]] in the category of Mathematical Sciences in 2008, India's highest honour for excellence in science, mathematics and technology.<ref>{{cite web|title=Shanti Swarup Bhatnagar Awards For Science And Technology 2008|url=http://www.dst.gov.in/awards/award08.htm|publisher=Department of Science & Technology, Govt of India|accessdate=1 July 2013}}</ref>
He was awarded the [[Shanti Swarup Bhatnagar Prize for Science and Technology]] in the category of Mathematical Sciences in 2008, India's highest honour for excellence in science, mathematics and technology.<ref>{{cite web|title=Shanti Swarup Bhatnagar Awards For Science And Technology 2008|url=http://www.dst.gov.in/awards/award08.htm|publisher=Department of Science & Technology, Govt of India|accessdate=1 July 2013}}</ref>

Revision as of 17:57, 12 January 2020

Jaikumar Radhakrishnan
Born30 May 1964
NationalityIndia
Alma materIIT Kharagpur, Rutgers University
AwardsShanti Swarup Bhatnagar Prize for Science and Technology
Scientific career
Fieldscombinatorics, communication complexity
InstitutionsTata Institute of Fundamental Research, Mumbai
Doctoral advisorEndre Szemerédi

Jaikumar Radhakrishnan (born 30 May 1964) is an Indian computer scientist specialising in combinatorics and communication complexity. He has served as dean of the School of Technology and Computer Science at the Tata Institute of Fundamental Research, Mumbai, India, where he is currently a senior professor.[1]

He obtained his B.Tech. degree in Computer Science and Engineering from the Indian Institute of Technology, Kharagpur in 1985 and his Ph.D. in Theoretical Computer Science from Rutgers University, NJ, USA, in 1991 under the guidance of Endre Szemerédi. His first research paper, titled "Better Bounds for Threshold Formulas", won the Machtey Award for best student paper at the IEEE Symposium on Foundations of Computer Science (FOCS) in 1991. His areas of research include combinatorics, graph theory, probability theory, information theory, communication complexity, computational complexity theory, quantum computation and quantum information science.

He was awarded the Shanti Swarup Bhatnagar Prize for Science and Technology in the category of Mathematical Sciences in 2008, India's highest honour for excellence in science, mathematics and technology.[2]

Other awards/honours

  • Fellow of the Indian Academy of Sciences, since 2007.

References

  1. ^ "Jaikumar Radhakrishnan" (PDF). Tata Institute of Fundamental Research, Mumbai. Retrieved 1 July 2013.
  2. ^ "Shanti Swarup Bhatnagar Awards For Science And Technology 2008". Department of Science & Technology, Govt of India. Retrieved 1 July 2013.


Flag of IndiaScientist icon

This article about an Indian scientist is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Jaikumar_Radhakrishnan&oldid=935455660"