1. S a h i l G r o v e r
Final year Undergraduate, Dept. of Computer Science and Engineering, IIT Kanpur
Email:gsahil@iitk.ac.in
Address:G-210/1, IITK
Phone: (+91)-9811149956
Nationality: Indian
Passport No. :M8419386
Education
Current B. Tech, Computer Science and Engineering, Indian Institute of Technology(IIT), Kanpur 9.7/10.0
Jul’13 Class 12th
, CBSE, Ramjas Public School, Day Boarding, Delhi 95.8%
Jul’11 Class 10th
, CBSE, Ramjas Public School, Day Boarding, Delhi 10.0/10.0 cgpa
Skill Set
Languages C++ (Proficient), Node.js (Proficient), JavaScript (Proficient), Python (Proficient),
Java(Intermediate), F# (Intermediate)
Tools Git (Proficient), Shell Scripting (Proficient), LaTeX (Proficient), IntelliJ IDEA (Intermediate)
OSs Linux (Proficient), Mac OSX (Proficient), Windows (Proficient)
Academic Achievements
2013-15 Received Academic Excellence Award at IIT Kanpur for two consecutive years.
2013 Secured All India Rank 214 in JEE ADVANCED among 150,000 students.
2013 Secured All India Rank 210 in JEE MAINS among 1,400,000 students.
2013 Secured All India Rank 2 in VITEEE.
2013 Awarded Certificate of Merit for being among the top 0.1% of successful candidates of ALL INDIA SCH CERTIFICATE
EXAMINATION in Computer Science.
2012 Awarded Kishore Vaigyanik Protsahan Yojana (KVPY) Fellowship.
2012 Qualified National Standard Examination in Astronomy (NIEA) .
2012 Awarded Certificate of Merit for being placed in Top 1% out of 12000 candidates registered for NIEA.
2012 Awarded Certificate of Merit for being placed in State-wise Top 1% in National Standard Examination in Chem-
istry.
2010 Secured Delhi Rank 14 in JSTSE among students of Delhi Schools.
Competitive Programming Achievements
May’16 Selected for ACM ICPC World Finals 2016 and secured Rank 51 from among 128 teams of three chosen from a
field of 40,266 contestants from 2,736 universities in 102 countries in six continents.
Dec’15 Secured Rank 1 among 60 teams in ACM ICPC Kolkata Regionals and received a cash prize of twenty five thousand
rupees.
Dec’15 Secured Rank 7 among 400 teams in ACM ICPC Amritapuri Regionals and received Honorable Mention.
Jul’16 One from among 25 out of 13000+ Indian teams to attend the Codechef Snackdown Finale held in Mumbai and
secured Rank 2 among Indian teams.
Mar’16 Selected for TCS CodeVita finals held in Hyderabad from among 64,843 Indian students.
2016 Won 1st prize in the event ‘Chaos’ held during Techkriti ’16 (Technological and Entrepreneurial festival of IIT
Kanpur). The event involved solving algorithmic questions in an unknown, esoteric programming language.
Jul’15 Secured Rank 12 among 4500+ participants all over the world in Codechef’s Long Challenge.
Jul’15 One from among 25 out of 1500+ Indian teams to attend the Codechef Snackdown Finale held in Mumbai.
ł2015 Secured 13th position (in a team of 3) among 900+ teams all over the world in IOPC held during Techkriti ’15
(Technological and Entrepreneurial festival of IIT Kanpur) .
2015 Won 1st prize in the event ‘Chaos’ held during Techkriti ’15 .
Dec’14 Secured Rank 26 among 400 teams in ACM ICPC Amritapuri Regionals and received Honorable Mention.
— Regular participant in weekly algorithmic competitions held on codeforces (handle: gsahil, max Rating: 1963)
— Ranked 2nd among Indian participants and 40th over-all in hackerRank (handle: gsahil, max. rating of 3765)
Projects
Bot Support For Flock May’16-Jul’16
Software Engineering Intern, Directi
• Integrated Flock (instant messaging app for office communications) with api.ai (an AI tool for making bots ) and Microsoft’s
Bot Platform using node.js offering developers’s an SDK to build intelligent apps on top of Flock.
• Made an Xml Generation Platform in java that enables a non-tech savvy person to generate xml for simple bots in Flock.
The platform saves the generated Xml in a database which is then used by bots as their state description. The platform
has an easy UI built in jQuery and html/css.
1

2. Probabilistic Polynomial Method in Circuit Complexity Jan’16-Apr’16
Research Project, Prof. Raghunath Tewari, IITK
• The polynomial method in circuit complexity is a way of obtaining better lower bounds for running time of algorithms
by exploiting the efficient translation of low-depth circuits to polynomials.
• Ryan Williams first proposed this method to solve the All Pairs Shortest Path (APSP) problem in sub-cubic time using
a randomized algorithm, and subsequently used the same technique for solving Boolean Orthogonal Detection in sub-
quadratic time.
• Studied and presented in a team of two, an analysis of the probabilistic polynomial construction, and how it led to better
lower bounds in the case of the aforementioned problems.
• Tried to approach the problem of fast minplus multiplication of two matrices given their tensor product decomposition.
Intelligent Tutoring System on Propositional Logic May’15-Jul’15
Research Project, Dr. Sumit Gulwani and Professor Amey Karkare, IITK
• Developed a system in F# to store offline all possible practical solution paths that a student can take while solving a given
propositional logic problem, using efficient abstract data structures.
• The system uses the stored abstract graphs (where nodes are mappings to truth-tables) to find a number of abstract
solutions and then further refines them to find concrete solutions, which are stored in form of a trie offline.
• The offline stored trie will then act as the back-end of our recommendation system to help the student solve the problem,
using Natural Deduction rules.
Median Of Huge Data-Set Jul’14-Nov’14
Data Structures and Algorithms, Professor Surender Baswana, IITK
• Reinvented the O(n) Median of medians algorithm, followed by two deterministic algorithms- a O(logn) pass and a two
pass algorithm with the help of small pointers.
• Implemented algorithms in C and tested them on 200GB dataset.
• Also implemented a much simpler randomized 2 pass algorithm and tested it on a 200GB dataset with an accuracy of 0.99.
PHP to x86 Compiler Jan’16-Apr’16
Compilers, Prof. Subhajit Roy
• Implemented in a team of four, an end-to-end PHP compiler for the x86 architecture.
• Project involved designing and implementing a Lexical Analyzer, Assembly-Code Generator and context free grammar rules
for PHP. Used Yacc and Lex in python for same.
• Implemented support for classes, recursive functions, short circuited conditional expressions and loops.
Fine Grained Classification of Vehicle Type Jan’16-Apr’16
Machine Learning, Prof. Harish Karnick
• Implemented and studied ML models to classify vehicles into 2/3/4 wheelers.
• Tried various classifiers like SVM, Decision Trees, Random Forests, Adaboost and various features like SIFT and HOG features
to improve accuracy of classification.
NachOS Aug’15-Nov’15
Operating Systems, Professor Mainak Chaudhari
• Implemented system calls pertaining to Fork, Exec, Join, Yield, Sleep and Exit, thereby extending the standard system call
library of NachOS.
• Implemented and evaluated performance of various process scheduling algorithms.
• Developed and added support for Demand Paging, Shared Memory, Condition Variables and Semaphores.
Windows Store App for JEE students Jan’15
• Participated in Microsoft’s event code.fun.do and secured runner up position among 100+ teams.
• Created a Windows Store Application through which a student could take snippets of important questions and can refer
to them with much ease saving him from the trouble of dealing with huge amount of papers.
• Through this application, a student can also judge his performance by giving auto-generated quizzes.
Positions of Responsibility
Project Mentor Jan’15-April’15
• Mentored a pair of B.Tech 1st year students on a problem of finding maximum number of disjoint paths from a source
vertex to destination vertex.
• Helped them to develop knowledge of basic graph theory and of network flows.
2

3. Secretary, ACA (Association of Computing Activities) 2014-15
• Organizing lectures, talks for first year B-tech students with department seniors, professors.
Relevant Courses
ESC101 : Fundamentals of Computing MTH101 : Analytical Calculus MTH102 : Linear Algebra and DE
CS201 : Discrete Mathematics CS210 : Data Structures and Algorithms CS251 : Computing Laboratory
CS202 : Mathematical Logic CS203 : Abstract Algebra CS220 : Computer Organization
MSO201 : Probability and Statistics CS345 : Algorithms - II CS330 : Operating Systems
CS350 : Principles of Programming Languages* CS252 : Computing Laboratory - II CS335: Compiler Design
CS771 : Machine Learning: Tools & Techniques CS425 : Computer Networks* MTH215 : Number Theory*
CS719 : Data Streaming: Algorithms & Systems* CS340 : Theory of Computation *ongoing
Co-Curricular Activities
2016 Organised International Open Programming Contest 2016 held during Techkriti ’16 (Technological and En-
trepreneurial festival of IIT Kanpur). The event involved solving algorithmic questions by teams all over the
world.
2009-10 Secured 1st position in Badminton Zonal Competition conducted by School Sports and Activities Board, Delhi –
Zone XVI, Distt. West A, Directorate of Education, Delhi.
ł2007-08 Awarded certificate of Best Badminton Player from Ramjas Public School, Day Boarding.
Date: 5th Aug’16
Place:Kanpur
3