 |
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (March 2011) |
Neeraj Kayal (Hindi: नीरज कयाल) is an Indian computer scientist. Kayal was born and raised in Guwahati, India.
Kayal graduated with a B.Tech from the Computer Science Department of the Indian Institute of Technology, Kanpur (IITK), India in 2002. In that year, he, Manindra Agrawal and Nitin Saxena proposed the AKS Primality Test,[1] which attracted worldwide attention, including an article in the New York Times.[2]
He was given the Distinguished Alumnus Award of the IITK,[3] for his work in computational complexity theory. He is also a recipient of the Gödel prize[4] and the Fulkerson Prize[5] for the same along with his co-authors.
Kayal received his PhD in theoretical computer science from the Department of Computer Science and Engineering at the Indian Institute of Technology, Kanpur. He did postdoctoral research at the Institute for Advanced Study in Princeton and at Rutgers University. He currently works as a researcher with the Microsoft Research Lab India.
References
- ^ Bornemann, F. Primes is in P: A Breakthrough for "Everyman". Notices of the AMS, May 2003.
- ^ Robinson, S. (August 8, 2002). "New Method Said to Solve Key Problem in Math". New York Times. http://www.nytimes.com/2002/08/08/us/new-method-said-to-solve-key-problem-in-math.html.
- ^ IIT Kanpur Alumni Association, Distinguished Alumnus Award Profile: Neeraj Kayal
- ^ European Association for Theoretical Computer Science (EATCS) announcement of 2006 Godel prize [1]
- ^ Fulkerson Prize Announcements
External links
- Neeraj Kayal's Homepage.
- Distinguished Alumnus Award Profile: Neeraj Kayal at the IIT Kanpur Alumni Association.
|
|||||
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
