Manindra Agrawal

Manindra Agrawal is an Indian computer scientist and mathematician known for his work in computational complexity theory and number theory, particularly for co-authoring the AKS primality test. He is a professor and former head of the Department of Computer Science and Engineering, IIT Kanpur and has held visiting positions at Carnegie Mellon University and collaborations with researchers at institutions such as Institute for Advanced Study, Princeton University, and University of California, Berkeley.

Early life and education

Agrawal was born in Kanpur, Uttar Pradesh, and educated at the Indian Institute of Technology Kanpur where he completed his undergraduate and master's degrees in computer science. He pursued doctoral studies at Carnegie Mellon University under the supervision of Gary Miller (computer scientist), engaging with faculty and visitors from institutions including Stanford University, Massachusetts Institute of Technology, and University of Illinois Urbana–Champaign during his Ph.D. His early academic formation connected him with researchers active in topics explored at venues such as the International Congress of Mathematicians and conferences like STOC and FOCS.

Academic career

After completing his doctorate, Agrawal returned to India and joined the faculty at the Indian Institute of Technology Kanpur, where he developed courses and research groups in theoretical computer science and cryptography. He has supervised doctoral students who later joined faculties at institutions such as IIT Bombay, IISc Bangalore, Tata Institute of Fundamental Research, and University of California, San Diego. Agrawal has been invited to speak at conferences organized by ACM, SIAM, and the European Association for Theoretical Computer Science, and has held visiting appointments at Princeton University and Carnegie Mellon University.

Research contributions and AKS primality test

Agrawal’s most widely recognized contribution is the AKS primality test, co-authored with Neeraj Kayal and Nitin Saxena, which resolved a central problem in computational number theory by presenting a deterministic, polynomial-time algorithm for primality testing. The AKS result connected areas represented by researchers affiliated with Bell Labs, Microsoft Research, IBM Research, and universities such as Harvard University and Yale University that had advanced randomized and conditional primality tests like the Miller–Rabin primality test and results contingent on the Extended Riemann Hypothesis. The AKS algorithm built on methods from polynomial identity testing, cyclotomic fields, and techniques discussed at venues like ICALP and SODA, influencing subsequent deterministic and practical algorithms for primality used in cryptography and standards developed by organizations like RSA (cryptosystem) implementers and protocol designers. Beyond AKS, Agrawal has published on topics including complexity classes studied at Complexity Conference (CCC), structural properties of NP and classes parallel to P, and algorithmic number theory problems explored by researchers from ETH Zurich, University of Oxford, and École Polytechnique Fédérale de Lausanne.

Awards and honors

Agrawal’s contributions earned several national and international recognitions, including the Shanti Swarup Bhatnagar Prize in Mathematical Sciences and the prestigious Gödel Prize awarded by the European Association for Theoretical Computer Science and the ACM SIGACT for the AKS paper. He has been elected to committees and academies such as the Indian National Science Academy and received awards and fellowships from institutions like Department of Science and Technology (India), Council of Scientific and Industrial Research, and honors presented at conferences including COLT and ICALP.

Selected publications and students

Selected publications include the seminal AKS paper published in major proceedings alongside works appearing in journals and conferences associated with SIAM Journal on Computing, Journal of the ACM, and proceedings of STOC and FOCS. Agrawal’s doctoral students and collaborators have included researchers who later published with academics at IISc Bangalore, IIT Madras, University of Toronto, and Princeton University. His publication record intersects with contributions from authors affiliated with Microsoft Research, Bell Labs, Tata Institute of Fundamental Research, University of California, Berkeley, and Cornell University on themes spanning primality testing, polynomial algorithms, and complexity theory.

Category:Indian computer scientists Category:Number theorists Category:IIT Kanpur faculty