|Alma mater||Indian Institute of Technology Kanpur|
|Awards||2006 Gödel Prize|
2006 Fulkerson Prize CSIR India SS Bhatnagar Award in Mathematical Sciences 2018
Theoretical computer science
|Institutions||CWI Amsterdam Indian Institute of Technology Kanpur|
|Doctoral advisor||Manindra Agrawal|
He attracted international attention for proposing the AKS Primality Test in 2002 in a joint work with Manindra Agrawal and Neeraj Kayal, for which the trio won the 2006 Fulkerson Prize, and the 2006 Gödel Prize. They provided the first unconditional deterministic algorithm to test an n-digit number for primality in a time that has been proven to be polynomial in n. This research work came out as a part of his undergraduate study.
He is an alumnus of Boys' High School And College, Allahabad. He graduated with his B.Tech in Computer Science and Engineering from Indian Institute of Technology Kanpur in 2002. He received his PhD from the Department of Computer Science and Engineering of the same institute in 2006 with the Dissertation titled "Morphisms of Rings and Applications to Complexity".
He was awarded the Distinguished Alumnus Award of the Indian Institute of Technology Kanpur in 2003 for his work in computational complexity theory. He was appointed at the Centrum Wiskunde & Informatica (CWI) starting as a postdoc researcher from September 2006 onwards. He was a Bonn Junior Fellow at the University of Bonn from Summer 2008 onwards. He joined the Department of Computer Science and Engineering at IIT Kanpur as faculty in April 2013.
- Saxena's CV at University of Bonn Archived 24 August 2009 at the Wayback Machine
- Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin. "Primes is in P" (PDF). Annals of Mathematics. doi:10.4007/annals.2004.160.781.
- Saxena's PhD thesis Archived 16 July 2011 at the Wayback Machine
- [permanent dead link]
- "Department of Computer Science and Engineering, IIT Kanpur". Retrieved 6 April 2013.