Contact Details

Center for Research on Computation and Society
School of Engineering and Applied Sciences
Harvard University
110 Maxwell-Dworking Laboratory
Initial of first name plus full last name AT seas DOT harvard DOT edu

My research interests lie in broad theoretical computer science.
My work includes projects in approximation algorithms, machine learning in general and clustering in particular,
algorithmic game theory and privacy. Differential privacy has been the focus of my research in last years. I am a proud
member of the Privacy Tools for Sharing Research Data project.

Teaching

In Fall 2014, together with prof. Kobbi Nissim, I am teaching a course on differential privacy.
This is a graduate-level course, open to undergraduate students as well.
Course Website.

On the Randomness Complexity of Property Testing, Oded Goldreich and Or Sheffet,
Journal of Computational Complexity 19 (2), 2010. Originally appeared in Approx/Random 2007.
Oded's page.
(Based on my M.Sc. thesis: “Reducing the Randomness Complexity of Property Testing, with an Emphasis on Testing Bipartiteness”.)

Graph Coloring with No Large Monochromatic Components, Nathan Linial, Jiri Matousek, Or Sheffet and Gabor Tardos, Journal of Combinatorial Theory Series B 17 (4), 2008.
Originally appeared in Eurocomb 2007.
Paper.
(Based on my “Amirim” Honors program final project: “On Ramsey Type Problems in Graphs, and the Largest Monochromatic Connected Component in a 2-Edge-Coloring of a Graph.”)