Professor Manindra Agrawal
was born in Allahabad on May 20, 1966. He did all his schooling
in Allahabad finishing with Intermediate in 1982 at Government
Inter College Allahabad. He then did BTech BTech (1986) and
PhD (1991) from the Department of Computer Science and Engineering
at IIT Kanpur. After a brief stint at Chennai Mathematical
Institute, he joined the department of Computer Science and
Engineering at IIT Kanpur in 1996. He is N Rama Rao chair
professor since 2003.
Manindra works in theory of computation; specifically, in
complexity theory, algorithmic number theory and algebra.
His best known work is in algorithmic number theory: along
with two of his students, he designed the first deterministic
polynomial time algorithm for testing primality of a number.
He has also contributed strongly to the Isomorphism Conjecture:
a conjecture that postulates a strong structure on NP-complete
sets. He has shown that for a large subclass of NP-complete
sets the conjecture indeed holds. Recently, he has been working
on the applications of finite rings in solving algorithmic
and complexity problems.
He is an editor of the journals Theory of Computing and Theory
of Computing Systems. He is a fellow of several academies:
Indian National Science Academy, Indian Academy of Sciences,
National Academy of Sciences, and Indian National Academy
of Engineers.
He is a recipient of several awards including Clay Research
Award (2002), ICTP Prize (2003), Distinguished Alumnus Award
of IIT Kanpur (2003), Meghnath Saha Award (2003), Godel Prize
(2005), and Fulkerson Prize (2005).
|
