Piyush P. Kurur

PhD (University of Madras)

Associate Professor, Department of Computer Science and Engineering


Research Interest



  • PhD, Institute of Mathematical Sciences, Chennai, University of Madras, 2002-2006.
  • M.Sc (by research), Institute of Mathematical Sciences, Chennai, Anna University, 2000-2002.
  • B.Tech, Computer Science and Engineering, Regional Engineering College Calicut, Kozhikode, University of Calicut, 1996-2000.



  • Fast Integer multiplication using Modular Arithmetic, with Anindya De, Chandan Saha and Ramprasad Saptharishi, In SIAM Journal of computing 42(2), pages 685-699, 2013.

  • Testing Nilpotence of Galois group in polynomial time, with V. Arvind In Transactions on algorithms Volume 8(3), July 2012, pages 32:1-32:22.

  • Graph Isomorphism is in SPP, with V. Arvind, Information and Computation 204(5), pages 835-852, 2006.

  • Bounded colour multiplicity Graph Isomorphism is in the #L-hierarchy. With V. Arvind and T. C. Vijayaraghavan. In 20th IEEE Conference on Computational Complexity, CCC, June 2005,

  • Quantum cyclic codes of length dividing pt +1, with Sagarmoy Dutta. In IEEE Symposium on Information Theory (ISIT) 2011.


CS 224,
Department of Computer Science and Engineering
IIT Kanpur,
Kanpur 208016

Office Phone: 0512-259-7584 (O)

Email: ppk[AT]iitk.ac.in


Birds at IIT Kanpur
Information for School Children
IITK Radio
Counseling Service