Resume Onepage
1
ANTHONY E. KIM [email protected] http://web.stanford.edu/ ~ tonyekim/ EDUCATION Stanford University Stanford, CA Ph.D. Candidate in Computer Science, focusing in Theoretical Computer Science Sept. 2012 - Present Advisor: Prof. Tim Roughgarden Overall GPA: 3.9/4.0 Select Coursework: CS246 Mining Massive Data Sets, CS229T Statistical Learning Theory, CS364A Algorithmic Game Theory Massachusetts Institute of Technology Cambridge, MA M.Eng. in Electrical Engineering and Computer Science September 2010 Thesis: On Network Coding Capacity - Matroidal Networks and Network Capacity Regions Advisor: Prof. Muriel M´ edard S.B. in Electrical Engineering and Computer Science with minor in Economics June 2009 S.B. in Mathematics June 2009 Overall GPA: 4.9/5.0 PUBLICATIONS Z. Huang and A. Kim. Welfare Maximization with Production Costs: A Primal Dual Approach. The ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015. S. Bhagat, A. Kim, S. Muthukrishnan, and U. Weinsberg. The Shapley Value in Knapsack Budgeted Games. The 10th Conference on Web and Internet Economics (WINE), 2014. An earlier version appeared in the Fifth International Workshop on Computational Social Choice (COMSOC), 2014. A. Kim and M. M´ edard. Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem. The IEEE International Symposium on Information Theory (ISIT), 2011. C. Daskalakis, A. Deckelbaum, and A. Kim. Near-Optimal No-Regret Algorithms for Zero-Sum Games. The 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011. A journal version to appear in Games and Economic Behavior. A. Kim and M. M´ edard. Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids. The 6th International Symposium on Turbo Codes and Iterative Information Processing, 2010. EXPERIENCE Technicolor Labs Palo Alto, CA Research Intern June 2013 - September 2013 Investigated a new class of cooperative games to model value division and showed the Shapley value can be computed efficiently when the game has a simple algorithmic representation. Presented at COMSOC 2014 and to appear in WINE 2014 (see Publications). Quora, Inc. Mountain View, CA Software Engineering Intern May 2012 - September 2012 Extended and engineered the existing news feed algorithm to topic-dedicated pages at the web Q&A technology start-up. Also contributed to a prototype of an internal user recruiting system during hack weeks. Oracle Corporation Redwood Shores, CA Software Engineer September 2010 - May 2012 Worked on the data storage engine of Oracle database server in a group of 20 people. Contributed to enhancement projects on the Oracle Exadata Hybrid Columnar Compression feature for efficient data storage and access. HONORS AND AWARDS NSF Graduate Research Fellowship (2012 - Present) Eta Kappa Nu National Honor Society for EECS USA Physics Olympiad - Finalist (2005) USA Computing Olympiad - Finalist (2003, 2004) COMPUTER SKILLS Familiar with C/C++, Python; Also have used Java, SQL, Matlab, Scheme, L A T E X
description
resume sample
Transcript of Resume Onepage
ANTHONY E. [email protected]
http://web.stanford.edu/~tonyekim/
EDUCATIONStanford University Stanford, CAPh.D. Candidate in Computer Science, focusing in Theoretical Computer Science Sept. 2012 - Present
Advisor: Prof. Tim RoughgardenOverall GPA: 3.9/4.0Select Coursework: CS246 Mining Massive Data Sets, CS229T Statistical Learning Theory, CS364A AlgorithmicGame Theory
Massachusetts Institute of Technology Cambridge, MAM.Eng. in Electrical Engineering and Computer Science September 2010
Thesis: On Network Coding Capacity - Matroidal Networks and Network Capacity RegionsAdvisor: Prof. Muriel Medard
S.B. in Electrical Engineering and Computer Science with minor in Economics June 2009S.B. in Mathematics June 2009Overall GPA: 4.9/5.0
PUBLICATIONSZ. Huang and A. Kim. Welfare Maximization with Production Costs: A Primal Dual Approach. The ACM-SIAMSymposium on Discrete Algorithms (SODA), 2015.
S. Bhagat, A. Kim, S. Muthukrishnan, and U. Weinsberg. The Shapley Value in Knapsack Budgeted Games.The 10th Conference on Web and Internet Economics (WINE), 2014. An earlier version appeared in the FifthInternational Workshop on Computational Social Choice (COMSOC), 2014.
A. Kim and M. Medard. Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem.The IEEE International Symposium on Information Theory (ISIT), 2011.
C. Daskalakis, A. Deckelbaum, and A. Kim. Near-Optimal No-Regret Algorithms for Zero-Sum Games. The22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011. A journal version to appear in Games andEconomic Behavior.
A. Kim and M. Medard. Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids.The 6th International Symposium on Turbo Codes and Iterative Information Processing, 2010.
EXPERIENCETechnicolor Labs Palo Alto, CAResearch Intern June 2013 - September 2013Investigated a new class of cooperative games to model value division and showed the Shapley value can becomputed efficiently when the game has a simple algorithmic representation. Presented at COMSOC 2014 andto appear in WINE 2014 (see Publications).
Quora, Inc. Mountain View, CASoftware Engineering Intern May 2012 - September 2012Extended and engineered the existing news feed algorithm to topic-dedicated pages at the web Q&A technologystart-up. Also contributed to a prototype of an internal user recruiting system during hack weeks.
Oracle Corporation Redwood Shores, CASoftware Engineer September 2010 - May 2012Worked on the data storage engine of Oracle database server in a group of 20 people. Contributed to enhancementprojects on the Oracle Exadata Hybrid Columnar Compression feature for efficient data storage and access.
HONORS AND AWARDSNSF Graduate Research Fellowship (2012 - Present)Eta Kappa Nu National Honor Society for EECSUSA Physics Olympiad - Finalist (2005)USA Computing Olympiad - Finalist (2003, 2004)
COMPUTER SKILLSFamiliar with C/C++, Python; Also have used Java, SQL, Matlab, Scheme, LATEX
