Yonatan Naamad
Location: Sunnyvale, CA WWW: www.yonatan.us
Mobile: 617-543-2068 E-mail: me@yonatan.us
Personal
Information
Princeton University, Princeton, New Jersey, USA
Education
Ph.D. Computer Science (Theory), 2017
Advisor: Moses Charikar
Research area: Theory of Algorithms
Thesis title: Hardness from Densest Subgraph Conjectures
2 years spent as visiting student at Stanford University
M.A. Computer Science (Theory), 2013
Advisor: Moses Charikar
Rensselaer Polytechnic Institute, Troy, New York, USA
M.S. Applied Mathematics, 2011
Advisor: Peter Kramer
B.S. Computer Science and Mathematics, 2011
Summa Cum Laude
Amazon.com, Inc.Appointments
Applied Scientist
Emerging Devices June 2018 - Present
Core Machine Learning / AWS AI Lab June 2017 - June 2018
Applied Scientist Intern
Core Machine Learning Summer 2016
RPI / Princeton
Teaching Assistant
Assistant Instructor - Networks, Economics, and Computation Spring 2013
Assistant Instructor - Networks, Economics, and Computation Fall 2012
Teaching Assistant - Calculus II Spring 2011
Teaching Assistant - Introduction to Discrete Structures Fall 2010
Teaching Assistant - Multivariable Calculus & Matrix Algebra Spring 2010
Undergraduate Teaching Assistant - Introduction to Logic Fall 2009
Undergraduate Teaching Assistant - Data Structures and Algorithms Spring 2009
World Bank
Temporary Employee
Short Term Temporary - Databases / Imputation Summer 2009
EMC Corporation (now Dell EMC)
Summer Intern
Technical Competitive Analysis Group Intern Summer 2007
Performance Group Intern Summer 2005
1 of 2
Research
(all ordered
alphabetically)
M. Charikar, Y. Naamad, J. Wu On Finding Dense Common Subgraphs Submitted
M. Charikar, Y. Naamad, A. Wirth On DkS-hardness for MinRep-hard Problems Manuscript
M. Charikar, Y. Naamad, J. Rexford, X. Zou Multi-Commodity Flow with In-Network Pro-
cessing Accepted to the 4th International Symposium on Algorithmic Aspects of Cloud Com-
puting (ALGOCLOUD) 2018
M. Charikar, Y. Naamad, A. Wirth On Approximating Target Set Selection Proceedings of
the 19th Intl. Workshop on Approximation Algorithms for Combinatorial Problems (AP-
PROX) 2016
M. Chakraborty, S. Das, A. Lavoie, M. Magdon-Ismail, Y. Naamad Instructor Rating Markets
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence 2013
Abstract appeared in the Proceedings of the Second Conference in Auctions, Mar-
ket Mechanisms, and Their Applications (AMMA) 2011
E. Anshelevich, S. Das, Y. Naamad Anarchy, Stability, and Utopia: Creating Better Match-
ings Autonomous Agents and Multi-Agent Systems (AAMAS) 2013
Prior conference version appeared in Proceedings of the 2nd International Sympo-
sium on Algorithmic Game Theory (SAGT) 2009
Awards
COMAP Mathematical Contest in Modeling
2011 - Outstanding Winner for Problem B (Repeater Coordination)
2010 - Outstanding Winner (SIAM Prize) for Problem B (Criminology)
Princeton Internal Awards
2014 Computer Science Graduate Teaching Award
RPI Internal Awards
2011 Paul A. McGloin Prize in Computer Science
2010 Founders Award of Excellence
2010 RPI Mathematics PhD Preliminary Exam “Passed with Distinction”
Skills
Development:
(bold preferred)
C, C++, C#, Haskell, Java, Javascript, Julia, Lua, Matlab,
MIPS, PHP, Prolog, Python 2/3, Scheme, SQL, Visual Basic
6/.Net
Tools:
AMPL, Arduino, Git, Keras/Tensorflow, scikit-learn, L
A
T
E
X, Unity
Operating Systems:
Windows, Linux, MacOS, FreeBSD
Languages:
English (native), Hebrew (native), Spanish (elementary)
Citizen of both USA and Israel.
Citizenship
2 of 2