Resume

Ankit Sharma
Computer Science and Engineering Department
Indian Institute of Technology Kanpur, India

E-mail id: ankit.iitk1@gmail.com

Phone Number: +91-9450346592
Home-Page: sites.google.com/site/ankitsharmahomepage/

Current Position
Project Associate
September, 2008 present
Mentor: Prof. Surender Baswana, Computer Science and Engineering, IIT Kanpur, India

Educational Qualications
Bachelor of Technology, Computer Science and Engineering, IIT Kanpur, India
Graduated in May, 2008

CPI: 9.9/10

Publications
Using Personal Electronic Device for Authentication-Based Service Access [pdf]
Abhishek Gaurav, Ankit Sharma, Vikas Gelara, Rajat Moona
In Proceedings of International Conference on Communication, 2008 at Beijing, China
Implementation of a Cooperative MAC protocol using a Software Dened Radio Platform [pdf]
Ankit Sharma, Vikas Gelara, Shashi Raj Singh , Thanasis Korakis , Pei Liu , Shivendra Panwar
In Proceedings of IEEE Workshop on Local Area Network and Metropolitan Area Networks, 2008 at
Romania

Patents
1. Using mobile device for authentication and service-access
Ankit Sharma, Abhishek Gaurav, Vikas Gelara, Rajat Moona
Patent application number: 1018/Del/2008 dated April 21, 2008

Academic Achievements
Secured All India Rank 4 in Indian Institute of Technology, Joint Entrance Examination (IITJEE),
2004.
Recipient of IIT Kanpur Certicate of Merit Award for Academic Excellence for 2004-05
and 2005-06 and The Times of India Scholarship for creditable performance in academics for the
years 20052008.
Selected up to National Level in Indian Chemistry Olympiad and qualied the rst and second
levels of National Talent Search Examination (NTSE), India.
Top 0.1% nation-wide in Computer Science and Chemistry in CBSE Class 12 examination, 2004, India.
Won rst prize in Paper aeroplane making competition and second prize for Thread-winder.

Hobbies
Tae-kwon-do (First at district-level belt promotion test for both yellow and green belts)

Ankit Sharma - Resume

Adobe India

Positions of Responsibility
Senator and Member, Finance Committee, Student Gymkhana, 2007-2008: Represented
a batch of around 400 students in Student Gymkhana and brought up issues relevant to the student
community. Managed budgets and nancial matters of Student Gymkhana
Reporter, Vox Populi, Campus Newspaper: Conducted an interview and reported events for
the campus newspaper.
Canteen Secretary, Hall of Residence V, 2006-2007: Managed the canteen of hostel V by
ensuring quality of food served, proper hygiene and service etc. Upgraded the canteen with new
furniture.
Executive, Public Relations Cell, Techkriti 2007, Science and Technology Festival: Invited
famous personalities for the technical festival of the university and managed their hospitality during
the festival.
Student Guide, Counseling Service, 2005-2006: Helped an assigned group of 7 newly enrolled
rst year students to get familiar with the university and to manage their academics and other activities
on campus.

Research Projects
1. Dynamic Algorithm for Maximum Matching [pdf]
September, 2008 present
Mentor: Prof. Surender Baswana, Department of Computer Science and Engineering, IIT Kanpur,
India
Problem Statement: Dynamic graph algorithms allow calculation of attributes of a graph under insertion/deletion of edges without the need to recompute from scratch each time the graph is updated.
Designed a fully-dynamic O(log(n)) algorithm for maximum-matching in a tree.
2. Analyzing Branch Prediction [pdf]
August, 2007 April, 2008
Mentor: Prof. Mainak Chaudhuri, Department of Computer Science and Engineering, IIT Kanpur,
India
Problem Statement: Branch predictors are implemented in microprocessors to predict the outcome of
branch instructions (such as if-else, switch) thereby enhancing the performance of the processor. We
aimed to improve the prediction accuracy of branch predictors as that would reduce the execution
time of certain programs to almost half.
Made a signicant nding that only about 64 branches account for more than 90% mispredictions
for most applications. This nding has drastically reduced the search space of tough-to-predict
branch instructions.
Made an important observation regarding jump register instruction which can prove to be a
reason for misprediction of the instruction.
3. Bilinear complexity of checking matrix multiplication [pdf]
August November, 2007
Mentor: Prof. Piyush P. Kurur, Department of Computer Science and Engineering, IIT Kanpur,
India
Problem Statement: We constructed a complexity measure called checking rank of randomized
testing of a bilinear map. Matrix-multiplication is an example of a bilinear map and Frievalds test
is a randomized test for checking matrix multiplication (i.e. checking if A*B=C; A, B and C being
matrices)
Two conjectures were made which together prove the optimality of Frievalds test under constructed complexity measure.

Ankit Sharma - Resume

Adobe India

4. Implementation of cooperative wireless protocol on software-dened radio [pdf]

May
July, 2007
Mentor: Prof. Thanasis Korakis, Department of Computer Science and Electrical Engineering, Polytechnic University, New York
Problem Statement: COOPMAC is a cooperative wireless medium-access control protocol developed
by Polytechnic University wherein network nodes cooperate with each other to help achieve greater
performance under adverse channel conditions.
Implemented COOPMAC on a software-dened radio and conducted extensive indoor and outdoor measurements to compare its performance against the standard wireless protocol.
Worked towards an improved rate adaptation algorithm.
5. Using personal electronic devices for authentication based service-access [pdf] May July,
2006
Mentor: Prof. Rajat Moona, Department of Computer Science and Engineering, IIT Kanpur, India
Problem Statement: Existing authentication based service-access methods, such as those in Automatic
Teller Machines, demand expensive infrastructure in form of user-interface, connectivity to server etc.
Research was done on the use of personal electronic devices such as mobile phones to provide for this
infrastructure at reduced costs.
Innovated the idea of using personal electronic devices for authentication and service-access.
Developed and implemented the trust model for the scenario and led the idea for patent.

Curricular projects
1. ALGOL compiler
Programming Language: C
Built a compiler for a simplied version of ALGOL, wherein support for user-dened data-types,
single-level of indirection, function call, branching constructs and arrays was provided. (Group of 4)
2. Extending NACHOS
Programming Language: C
Extended the existing NACHOS operating system to implement paging, scheduling of multiple processes, virtual memory management and le system management. (Group of 3)
3. Chat client
Programming Language: C++
Built a chat programme in which facilities such as one-to-one talk, conference initiated by a single
person, and le transfer were incorporated. (Group of 2)
4. Pipelined MIPS processor
Programming Language: Verilog
Programmed a MIPS-pipelined processor with 5 stages of pipeline by extending a basic framework.
(Individual)
5. SDLX processor
Programming Language: Verilog
Programmed a SDLX processor on Field Programmable Gate Array boards. (Group of 2)
6. Interpreter for Kernel Language
Programming Language: SML
Built an interpreter for Kernel Language of Oz with support for exception handling, pattern matching
and function calls. (Group of 2)
7. Ludo
Programming Language: Java
Programmed a game of Ludo to enable a game between a human player and a computer counterpart.
(Group of 3)

Major Courses
Randomized Algorithms
Theory of Computation
Discrete Mathematics
Ankit Sharma - Resume

Algorithms-II
Advanced Computer Architecture
Quantum Computation
3

Computer Networks
Computer Architecture
Computer Organization
Adobe India