Piyush SrivastavaC-213, Hall 1, IIT Kanpur, Kanpur - 208016, India. Email: piyushs@iitk.ac.in. Phone: +91-9415279116.

Program: Computer Science and Engineering(B. Tech.) Date of Birth: 7th February, 1988.

EDUCATION

Year Degree/Certificate Institution CGPA/% Remarks2005-continuing Bachelor of Technol-

ogy, (Computer Sci-ence and Engineering)

IIT Kanpur 10.0/10.0 Highest CGPA in thebatch.

2005 Class 12(ISC) Boys’ High School andCollege, Allahabad

98.0% 1st in India.

2005 Class 10(ICSE) Boys’ High School andCollege, Allahabad

96.2% 1st in the Allahabaddistrict.

AWARDS AND HONORS• Represented India and won a Gold Medal at the International Physics Olympiad, 2005.• 1st in the Joint Entrance Examination(JEE), 2005 of the Indian Institutes of Technology.• 1st in the Indian National Mathematical Olympiad, 2005.• Academic Excellence award for the years 2005-2006 and 2006-2007 at the Indian Institute of Technology

Kanpur.• Recipient of the Aditya Birla Group Scholarship awarded annually to ten students chosen from the

IIT Kanpur, Kharagpur, Delhi, Bombay and Madras and BITS PIlani.• Recipient of the Kishore Vaigyanik Protsahana Yojana(KVPY) fellowship of the the Department

of Science and Technology, Government of India(2003-2005), which is awarded annually to around 40 highschool students across India.

• Selected for the award of the National Talent Search Scholarship, awarded by the National Councilof Educational Research and training(NCERT), New Delhi, India, in 2003.

SELECTED PROJECTS• Designing and implementing a compiler for an Object-Oriented subset of the Eiffel program-

ming language, with Amit Kumar, C Saipriyadarshan, Nitin Agrawal and Sajal Sinha. Guide:ProfSanjeev K Aggarwal, IIT Kanpur. We implemented a compiler for Eiffel, including features such asEncapsulation and also an interface to libc, with around 8500 lines of code in C++, lex, yacc and someglue code in Bash and PERL. Our project was declared the Best Project in the class.

• Average Case Complexity Theory Guides: Prof. Christopher Umans and Prof. Leonard Schulman,California Institute of Technology. In this project, we generalized an upper bound on the min-entropyof distributions under which a problem can be distNP complete under deterministic reductions, and alsoshowed some weak restriction on randomized reductions to distNP complete problems with a uniformdistribution.

• Designing an Article Search Portal, with Ankit Sinha. Guide: Prof. Sumit Ganguly, IIT Kanpur.We implemented an Article Search system with separate sub-systems for administrators and normal users,and features like on-the-fly coauthor graph generation, academic distances, search by various parameterslike name, keywords etc. The project used a mysql back end, and a Apache/PHP front end. The codelength was approximately 2000 lines of PHP/PHP-MySql/HTML code.

• Techniques for proving lower bounds for the estimation of the pth norms over data streams,with Purushottam Kar. Guide: Prof Sumit Ganguly, IIT Kanpur. We are exploring techniques forproving lower bounds for randomized estimation of the pth norm in a data streaming model, using a novelstream automaton model recently proposed by Prof. Ganguly.

• Studying elementary approaches toward a proof of Cramer’s Conjecture on the gap betweenconsecutive primes Guide: Prof Manindra Agrawal, IIT Kanpur. In this project we are exploring anelementary approach towards proving asymptotic upper bounds on the gap between consecutive primes.

• Approximative techniques for embedding Matrix Multiplication in Group AlgebrasGuide: Prof Piyush P Kurur, IIT Kanpur. In this project, we propose a scheme for approximatelyembedding matrix multiplication into group algebras, and present conjectures based on this approachwhich if true would lead to non-trivial upper bounds for the exponent of matrix multiplication.

• Bilinear map testing, and the relationship of techniques used in studying bilinear maps withQuantum Entanglement. Guide: Prof Piyush P Kurur, IIT Kanpur. This project, on which I alsoworked during Summer 2008, is in continuation of the work that we had been doing on the embeddingof matrix multiplication in group algebras. Here, we seek to construct a measure of the complexity oftesting bilinear maps. We also explore the relationship of the techniques used here with the problem ofquantifying Quantum entanglement.

COURSES• Computer Science: Systems Programming Tools and Techniques, Principles of Database Manage-

ment Systems. Operating Systems, Computer Organization, Principles of Programming Languages, andCompiler Design.

• Computer Science: Theory and Algorithms Data Streaming: Algorithms and Systems, Algorithms-II, Data Structures and Algorithms-I, Discrete Mathematics, Modern Cryptology(audited), ComputationalComplexity(audited), Computational Number Theory and Algebra, Theory of Computation, and QuantumComputation, Special topics in Computer Science(two Project Courses, where I worked on the MatrixMultiplication Problem), and B. Tech. Project.

• Mathematics Mathematics-I(Real Analysis and Vector Calculus), Mathematics-II(Complex Analysis andLinear Algebra), Mathematics-III(Differential Equations), and Analysis-I(Analysis on Metric Spaces).

PROGRAMMING AND SCRIPTING LANGUAGES• Fluent in C, C++ and Java. Intermediate in PHP, Perl and Bash. Familiar with GAP, Oz, Matlab,

Haskell, and Python.

• Markup and web-scripting languages: LATEX, HTML, JavaScript.

CONTESTS AND EXTRA-CURRICULAR ACTIVITIES• Member of the highest ranked IIT Kanpur team(9th based on time, with 6 out of 7 problems solved) at

the ACM International Collegiate Programming Contest Asia Regionals - 2007, at Kanpur site.

• Won and had several top 3 finishes in intra-IITK programming contests organised by the programmingclub, IITK

• One of the Co-ordinators for SciMaTex, the group of science and mathematics related events in Techkriti-2008, the annual Science and Technology festival at IIT Kanpur.

• Member of the problem setting team for the International Online Programming Contest(IOPC)at Techkriti-2008 and Techkriti-2007.