Jaikumar Radhakrishnan (born 30 May 1964) is an Indian computer scientist specialising in

combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many ...

and

communication complexity In theoretical computer science, communication complexity studies the amount of communication required to solve a problem when the input to the problem is distributed among two or more parties. The study of communication complexity was first intro ...

. He has served as dean of the School of Technology and Computer Science at the

Tata Institute of Fundamental Research Tata Institute of Fundamental Research (TIFR) is a leading research Institute under the Department of Atomic Energy of the Government of India. It is a public deemed university located at Navy Nagar, Colaba in Mumbai. It also has a centres in ...

Mumbai Mumbai ( ; ), also known as Bombay ( ; its official name until 1995), is the capital city of the Indian state of Maharashtra. Mumbai is the financial capital and the most populous city proper of India with an estimated population of 12 ...

, India, where he is currently a senior professor. He obtained his B.Tech. degree in Computer Science and Engineering from the

Indian Institute of Technology, Kharagpur The Indian Institute of Technology Kharagpur (IIT Kharagpur or IIT-KGP) is a Public university, public institute of technology, research university, and autonomous institute established by the Government of India in Kharagpur, West Bengal. Foun ...

in 1985 and his Ph.D. in Theoretical Computer Science from

Rutgers University Rutgers University ( ), officially Rutgers, The State University of New Jersey, is a Public university, public land-grant research university consisting of three campuses in New Jersey. Chartered in 1766, Rutgers was originally called Queen's C ...

, NJ, USA, in 1991 under the guidance of

Endre Szemerédi Endre Szemerédi (; born August 21, 1940) is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science a ...

. His first research paper, titled "Better Bounds for Threshold Formulas", won the

Machtey Award The Machtey Award is awarded at the annual IEEE Symposium on Foundations of Computer Science (FOCS) to the author(s) of the best student paper(s). A paper qualifies as a student paper if all authors are full-time students at the date of the submiss ...

for best student paper at the IEEE

Symposium on Foundations of Computer Science The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science. FOCS is sponsored by the IEEE Computer Society. As writes, FOCS and its annual Association for Computing ...

(FOCS) in 1991. His areas of research include

graph theory In mathematics and computer science, graph theory is the study of ''graph (discrete mathematics), graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of ''Vertex (graph ...

probability theory Probability theory or probability calculus is the branch of mathematics concerned with probability. Although there are several different probability interpretations, probability theory treats the concept in a rigorous mathematical manner by expre ...

information theory Information theory is the mathematical study of the quantification (science), quantification, Data storage, storage, and telecommunications, communication of information. The field was established and formalized by Claude Shannon in the 1940s, ...

computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem ...

quantum computation A quantum computer is a computer that exploits quantum mechanical phenomena. On small scales, physical matter exhibits properties of both particles and waves, and quantum computing takes advantage of this behavior using specialized hardware. C ...

and

quantum information science Quantum information science is a field that combines the principles of quantum mechanics with information theory to study the processing, analysis, and transmission of information. It covers both theoretical and experimental aspects of quantum phys ...

. He was awarded the

Shanti Swarup Bhatnagar Prize for Science and Technology Shanti or Shanthi may refer to: In Sanskrit * Inner peace, a state of being mentally and spiritually at peace, with enough knowledge and understanding to keep oneself strong in the face of discord or stress * Kshanti, one of the paramitas of B ...

in the category of Mathematical Sciences in 2008, India's highest honour for excellence in science, mathematics and technology.

Other awards/honours

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

References

1964 births Living people 20th-century Indian mathematicians Recipients of the Shanti Swarup Bhatnagar Award in Mathematical Science {{India-scientist-stub