Post Job Free
Sign in

Computer Science Assistant

Location:
Ithaca, NY
Posted:
February 06, 2013

Contact this candidate

Resume:

Yogeshwer Sharma

**** ***** ****, ******** *******, Cornell University, Ithaca, NY 14853

abqr6b@r.postjobfree.com http://www.cs.cornell.edu/w8/~yogi +1-607-***-****

I am interested in the theoretical aspects of Computer Science. Speci cally, my research

Research

focuses on computational and online learning, game theory, mechanism design,

interests

and approximation algorithms. I am particularly interested in the questions at the

interface of game theory and learning.

Ph. D. (Computer Science, Cornell University)

Education August 2004 present

Advisors: David Williamson and Robert Kleinberg.

Thesis: Expressive models for online learning and network design.

Minor degree: Operations Research and Information Engineering.

B. Tech. (Computer Science & Engineering, IIT Kanpur, India) July 2000 May 2004

Advisor: Somenath Biswas.

Thesis: Density of generalized Carmichael numbers and their use in primality testing.

GPA: 9.9/10.0.

Professional May August 2008

Research intern

Microsoft Research, Silicon Valley, CA.

experience

May July 2003

Intern

Programming Logics group (AG2), MPI, Saarbr cken, Germany.

u

Best Student Paper Award for the paper Regret bounds for sleeping experts and

Awards and

bandits . COLT 2008.

honors

Certi cate of achievement for teaching for outstanding accomplishments and contri-

butions as a teaching assistant. Cornell University, Fall 2006, Fall 2007, Fall 2008.

John Hopcroft Fellowship, Department of Computer Science, Cornell University, Fall 2005.

The President s Gold Medal for the best academic performance in the graduating class

in all disciplines of the undergraduate programmes of study. IIT Kanpur, May 2004.

Various awards for academic performance during college (IIT Kanpur), including The

General Pro ciency Award (May 2004), The Certi cate of Merit for Academic Excellence

(2000 2001, 2001 2002, 2002 2003), Dr. V. Rajaraman Scholarship (Jan 2004), Neeraj

Kapoor Scholarship (2003 2004), D. R. Bhagat Scholarship (2002 2003).

Indian National Mathematics Olympiad, 1999.

1st rank in 10th grade in all Navodayas of India (about 450 schools). Invited to visit Indian

Space Research Organization Centers, Jan 1999.

36th rank in India in the entrance test for Rashtriya Indian Military College, Dehradun.

1996.

Moshe Babaio, Yogeshwer Sharma, and Aleksandrs Slivkins. Characterizing truthful

Publications

multi-armed bandit mechanisms. In ACM Conference on Electronic Commerce (EC) 2009,

pages 79 88.

Yogeshwer Sharma and David Williamson. Stackelberg thresholds in network routing

games or the value of altruism. Games and Economic Behavior, 67(1):174 190, September

2009. Preliminary version appeared in ACM Conference on Electronic Commerce (EC)

2007, pages 93 102. Invited to Games and Economic Behavior.

Robert Kleinberg, Alex Niculescu-Mizil, and Yogeshwer Sharma. Regret bounds for sleep-

ing experts and bandits. To appear in Machine Learning Journal. Preliminary version

appeared in Conference on Learning Theory (COLT) 2008, pages 425 436. Best Student

Paper Award. Invited to Machine Learning Journal.

Chandrashekhar Nagarajan, Yogeshwer Sharma, David Williamson. Approximation algo-

rithms for prize-collecting network design problems with general connectivity requirements.

In Workshop on Approximation and Online Algorithms (WAOA) 2008, pages 174 187.

Yogeshwer Sharma, Chaitanya Swamy, David Williamson. Approximation algorithms for

prize-collecting forest problems with submodular penalty functions. In ACM-SIAM Sym-

posium on Discrete Algorithms (SODA) 2007, pages 1275 1284.

Lukas Kroc, Yogeshwer Sharma, Mahesh Balakrishnan, Ken Birman. An analytical ap-

Under

proach to designing message ferry routes. Available online at http://www.cs.cornell.

submission

edu/~mahesh/pizzas-full.pdf, 2008.

Approximation algorithms for prize-collecting forest problems

Talks

Symposium on Discrete Algorithms (SODA) 2007, New Orleans, January 2007.

Thesis Proposal, Cornell University, May 2007.

Stackelberg thresholds in network routing games or the value of altruism

ACM Conference on Electronic Commerce 2007, San Diego. June 2007.

Theory Seminar, Department of Computer Science, Cornell University, April 2007.

Department of Computer Science & Engineering, IIT Kanpur, January 2008.

Regret bounds for sleeping experts and bandits

Microsoft Research, Silicon Valley, June 2008.

Conference on Learning Theory, COLT 2008, Helsinki, Finland, July 2008.

Arti cial Intelligence Seminar, Cornell University, Fall 2008.

INFORMS Applied Probability Society Conference, Cornell University, July 2009.

Characterizing truthful multi-armed bandit mechanisms

Microsoft Research, Silicon Valley, August 2008.

Theory Seminar, Cornell University, February 2009.

ACM Conference on Electronic Commerce 2009. Stanford, July 2009.

The 2nd Eastern Great Lakes Theory of Computation Workshop, October 2009.

Teaching Fall 2008

Teaching for Introduction to Theory of Computation

Taught quarter of the course Introduction to Theory of Computation for Prof. John

Hopcroft.

2004 2009

Teaching assistant

Responsibilities included holding o ce hours, review sessions and individual appointments

with students; helping design, write solutions for, and grade exams and homeworks; peri-

odically giving lectures; and managing a group of undergraduate TAs.

Introduction to Theory of Computing (with John Hopcroft, Fall 2007)

Introduction to Theory of Computing (with John Hopcroft, Fall 2006)

Introduction to Algorithms (with Tom Wexler, Spring 2006)

Discrete Structures (with Eva Tardos, Spring 2005)

Introduction to Java Programming (with Graeme Bailey, Fall 2004)

Summer 2004, IIT Kanpur

Co-Instructor for Data Structures and Algorithms

Co-taught a course on Data Structures and Algorithms for freshmen and sophomores.

Fall 2006 present

Guest lectures

Introduction to the Theory of Computing (Fall 2006, Fall 2007)

Introduction to Analysis of Algorithms (Spring 2006)

The Design and Analysis of Algorithms, a graduate algorithms course (Fall 2008)

Mathematical Programming I, a graduate course in Operations Research (Fall 2008)

Algorithms and optimization: network ows, approximation algorithms, matroid the-

Courses

ory, scheduling algorithms, mathematical and linear programming, algorithms on random

graphs, advanced algorithms.

Game theory, electronic markets, and information networks: information-theoretic

aspects of algorithms (network coding, error correcting codes, compressed sensing), com-

putational learning theory, algorithmic game theory, structure of information networks.

Mathematics and theory: stochastic processes, probability theory, complexity the-

ory, theory of computation*, mathematical statistics*, linear algebra*, algebra*, analytic

number theory*, analysis*, topology*.

Courses with programming component: advanced systems, advanced programming

languages, introduction to algorithms*, operating systems*, introduction to programming

languages*, programming tools and techniques*, compilers*, databases*, mobile comput-

ing*, computer architecture*, networking*.

Education: innovative teaching in the sciences, international teaching assistant develop-

ment workshop (2 weeks).

(* indicates undergraduate courses)

Languages: C, C++ (basic), Java, Scheme (basic), Python (basic).

Programming

Operating Systems: Linux, Windows (basic).

skills

Other Tools: Vim and Vim-Script, L TEX, Lex, Yacc, Subversion, Shell Programming.

A

Professional Referee

SIAM Journal on Computing (SICOMP), Mathematics of Operations Research, AAAI

services

Conference on Arti cial Intelligence 2008, SODA 2009, International Joint Conferences

on Arti cial Intelligence (IJCAI) 2009, Workshop on Internet and Network Economics

(WINE) 2009, ACM Conference on Electronic Commerce (EC) 2009, STOC 2010.

Fall 2005 Spring 2007

Organizer, Cornell Theory Discussion Group

Extra- August 2008 December 2009

President, Samadhi Cornell Yoga Club

curricular

2009 2010

Telluride Hall full room and board scholarship

Accepted at Cornell Branch of Telluride Association for up to ve years. (Declined)

Interests

Yoga, Triathlon, Juggling, Running, Gymnastics, Volleyball.

David Williamson, OR&IE, Cornell University, abqr6b@r.postjobfree.com.

References

Robert Kleinberg, Computer Science, Cornell University, abqr6b@r.postjobfree.com.

John Hopcroft, Computer Science, Cornell University, abqr6b@r.postjobfree.com.

Alex Slivkins, Microsoft Research, Silicon Valley, abqr6b@r.postjobfree.com.

e.dvi



Contact this candidate