Piyush Srivastava

C-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
2005-continuing

2005

Degree/Certicate
Bachelor of Technology, (Computer Science and Engineering)
Class 12(ISC)

2005

Class 10(ICSE)

Institution
IIT Kanpur

Boys High School and

College, Allahabad
Boys High School and
College, Allahabad

CGPA/%
10.0/10.0

Remarks
Highest CGPA in the
batch.

98.0%

1st in India.

96.2%

1st in the Allahabad

district.

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 high
school students across India.
Selected for the award of the National Talent Search Scholarship, awarded by the National Council
of Educational Research and training(NCERT), New Delhi, India, in 2003.

SELECTED PROJECTS
Designing and implementing a compiler for an Object-Oriented subset of the Eiel programming language, with Amit Kumar, C Saipriyadarshan, Nitin Agrawal and Sajal Sinha. Guide:Prof
Sanjeev K Aggarwal, IIT Kanpur. We implemented a compiler for Eiel, including features such as
Encapsulation and also an interface to libc, with around 8500 lines of code in C++, lex, yacc and some
glue 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-entropy
of distributions under which a problem can be distNP complete under deterministic reductions, and also
showed some weak restriction on randomized reductions to distNP complete problems with a uniform
distribution.
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-y coauthor graph generation, academic distances, search by various parameters
like name, keywords etc. The project used a mysql back end, and a Apache/PHP front end. The code
length 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 for
proving lower bounds for randomized estimation of the pth norm in a data streaming model, using a novel
stream automaton model recently proposed by Prof. Ganguly.

 Studying elementary approaches toward a proof of Cramers Conjecture on the gap between
consecutive primes Guide: Prof Manindra Agrawal, IIT Kanpur. In this project we are exploring an
elementary approach towards proving asymptotic upper bounds on the gap between consecutive primes.
Approximative techniques for embedding Matrix Multiplication in Group Algebras
Guide: Prof Piyush P Kurur, IIT Kanpur. In this project, we propose a scheme for approximately
embedding matrix multiplication into group algebras, and present conjectures based on this approach
which 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 with
Quantum Entanglement. Guide: Prof Piyush P Kurur, IIT Kanpur. This project, on which I also
worked during Summer 2008, is in continuation of the work that we had been doing on the embedding
of matrix multiplication in group algebras. Here, we seek to construct a measure of the complexity of
testing bilinear maps. We also explore the relationship of the techniques used here with the problem of
quantifying Quantum entanglement.
COURSES
Computer Science: Systems Programming Tools and Techniques, Principles of Database Management Systems. Operating Systems, Computer Organization, Principles of Programming Languages, and
Compiler Design.
Computer Science: Theory and Algorithms Data Streaming: Algorithms and Systems, AlgorithmsII, Data Structures and Algorithms-I, Discrete Mathematics, Modern Cryptology(audited), Computational
Complexity(audited), Computational Number Theory and Algebra, Theory of Computation, and Quantum
Computation, Special topics in Computer Science(two Project Courses, where I worked on the Matrix
Multiplication Problem), and B. Tech. Project.
Mathematics Mathematics-I(Real Analysis and Vector Calculus), Mathematics-II(Complex Analysis and
Linear Algebra), Mathematics-III(Dierential 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 nishes in intra-IITK programming contests organised by the programming
club, IITK
One of the Co-ordinators for SciMaTex, the group of science and mathematics related events in Techkriti2008, 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.