त्वरित संपर्क
Piyush P. Kurur
PhD (University of Madras)
Associate Professor, Department of Computer Science and Engineering
शोध करना दिलचस्पी
Computational Complexity, Computational Algebra.
Office
CS 224,
Department of Computer Science and Engineering
IIT Kanpur,
Kanpur 208016
विशेषज्ञता
Computational Complexity, Randomized Algorithms, logic
शिक्षा
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.