Nitin Saxena Email: This email address is being protected from spambots. You need JavaScript enabled to view it.
Associate Professor
Department of Computer Science and Engineering

Office Phone: 91(512)2597588

Fax : 91(512)2597586

   


Research Interests

Computational Complexity Theory, Flavored with Computational Algebra, Number Theory, Algebraic-Geometry, Algebraic-Topology and Algebraic-Combinatorics.

 

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget

 

  • 2011-Best Paper at ICALP Conference, Awarded by EATCS the Best Paper Award (Track A) for the joint paper Algebraic independence and blackbox identity testing.
  • 2006-IEEE Conference on Computational Complexity Awards, Awarded both the Best Paper Award and the Ronald V. Book Best Student Paper Award for the joint paper Polynomial Identity Testing for Depth 3 Circuits.
  • 2006-Godel Prize, Awarded by ACM-SIGACT & EATCS for the joint paper PRIMES is in P.http://www.sigact.org/Prizes/Godel/
  • 2006-Fulkerson Prize, Awarded by AMS & MPS for the joint paper PRIMES is in P. http://www.ams.org/prizes/fulkerson-prize.html
Recognition
  • 2010-IITK@50, Amongst the top 50 alumni, voted by the IIT-K Alumni to celebrate 50 years.
  • 2005-IBM Award, Awarded the Outstanding PhD Student Award of IBM India Research Lab.
  • 2003-Distinguished Alumnus Award of IIT Kanpur, http://www.iitkalumni.org/daa/DAAProfile2.asp?id=39
  • 2003-Global Indus Technovators Awards, http://web.mit.edu/technovators/gita
  • 2002–2006 Infosys PhD Fellowship,
  • 2002-Best B.Tech Project Award, For my joint undergraduate thesis.
  • 1999-Notional Scholarship, For excellent performance in the first 2 semesters of study under the B.Tech (IIT-K) program.
  • 1997-Indian National Mathematics Olympiad, I was selected to attend the International Mathematics Olympiad Training Camp (IMOTC ’97 &IMOTC ’98) and awarded the Prize for “Best Solution to a Challenging Problem” in both the Camps(Bhabha Atomic Research Center, Mumbai).

Computer Science and Engineering
Associate Professor Department of Computer Science and Engineering 

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.

 

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.

 

 

  • “Quasi-polynomial hitting-set for set-depth-∆ formulas” (with Manindra Agrawal and Chandan Saha), 45th ACM Symposium on Theory of Computing (STOC), 2013.
  • “Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcen- dence degree-k circuits” (with Manindra Agrawal, Chandan Saha and Ramprasad Saptharishi), 44th ACM Symposium on Theory of Computing (STOC), pp.599-614, 2012. [Invited in the special issue of SICOMP.]
  • “Algebraic independence and blackbox identity testing” (with Malte Beecken and Johannes Mittmann),38th International Colloquium on Automata, Languages and Programming (ICALP), pp.137-148,2011. [Awarded the Best Paper in Track A. Invited & published in the special issue of Inform. Com- put.]
  • “Blackbox identity testing for bounded top fanin depth-3 circuits: The field doesn’t matter” (with C. Seshadhri), 43rd STOC, pp.431-440, 2011. [Invited & published in the special issue of SICOMP.]
  • “From Sylvester-Gallai configurations to rank bounds: Improved black-box identity test for depth-3 circuits” (with C. Seshadhri), 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.21-29, 2010. [Accepted in J.ACM.]
  • “Polynomial identity testing for depth 3 circuits” (with Neeraj Kayal), 21st IEEE Conference on Computational Complexity (CCC), pp.9-17, 2006. [Awarded the Best Paper and Best Student Paper Awards. Invited & published in the special issue of Comp. Complex.]
  • “PRIMES is in P” (with Manindra Agrawal and Neeraj Kayal), Annals of Mathematics, vol.160(2), 781-793, 2004. [Awarded G¨odel Prize 2006 and Fulkerson Prize 2006.]

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.

 

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.

 

Nitin Saxena
Department of Computer Science and Engineering
(Room no. 212)
IIT Kanpur
Kanpur, UP 208016, India
O: +91 512 259-7588 Fax: +91 512 259-7586 Residence
House no. 353, IIT-K
R: +91 512 259-8615
M: +91-89530-36836 

  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.
  • Lorem ipsum dolor sit amet, consectetur adipiscing elit. Proin mollis blandit neque, quis tristique nunc faucibus eget.

 

Education

  • Doctor of Philosophy CSE IIT Kanpur

  • Bachelor of Technology CSE IIT Kanpur

Websites

CV