Contact Details
Computer Science Department
Carnegie Mellon University
7004 Gates Hillman Center
Initial of first name plus full last name AT cs DOT cmu DOT edu
About Me
I'm a PhD Candidate in
the Computer Science Department in Carnegie Mellon University, advised by prof. Avrim Blum. My research interests lie in machine learning in general and clustering in particular, algorithmic game theory and privacy.
I have a B.Sc degree in math and computer science from the Hebrew University in Jerusalem, Israel, where I was fortunate to work with prof. Nati Linial.
I got my M.Sc in computer science from the Weizmann Institute of Science, where I had the honor of being advised by prof. Oded Goldreich.
Publications
-
Differentially Private Analysis of Social Networks via Restricted Sensitivity, Jeremiah Blocki, Avrim Blum, Anupam Datta and Or Sheffet, ITCS 2013.
Paper.
-
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy, Jeremiah Blocki, Avrim Blum, Anupam Datta and Or Sheffet, FOCS 2012.
Page.
-
Additive Approximation for Near-Perfect Phylogeny Construction, Pranjal Awasthi, Avrim Blum, Jamie Morgenstern and Or Sheffet, APPROX-RANDOM 2012.
Paper. (Full version.)
-
Improved Spectral Norm Bounds for Clustering, Pranjal Awasthi and Or Sheffet, APPROX-RANDOM 2012.
Paper. (Full version.)
-
Predicting Preference Flips in Commerce Search, Samuel Ieong, Nina Mishra and Or Sheffet, ICML 2012.
Page.
-
Optimal Choice Functions: A Utilitarian View, Craig Boutilier, Ioannis Caragiannis, Simi Haber, Tyler Lu, Ariel Procaccia and Or Sheffet, EC 2012.
Page.
-
Send Mixed Signals – Earn More, Work Less, Peter Bro Miltersen and Or Sheffet, EC 2012.
Paper.
-
Center-based Clustering under Perturbation Stability, Pranjal Awasthi, Avrim Blum and Or Sheffet, Information Processing Letters, 112(1-2).
Paper.
-
Stability Yields a PTAS for k-Median and k-Means, Pranjal Awasthi, Avrim Blum and Or
Sheffet, FOCS 2010.
Page.
-
On Nash-Eqilibria of Approximation-Stable Games, Pranjal Awasthi, Nina Balcan, Avrim
Blum, Or Sheffet and Santosh Vempala. SAGT 2010.
Paper. Journal Version (for general audience).
-
Improved Guarantees for Agnostic Learning of Disjunctions, Pranjal Awasthi, Avrim Blum and Or Sheffet, COLT 2010.
Paper.
-
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” Excel program final project: “On Ramsey Type Problems in Graphs, and the Largest Monochromatic Connected Component in a 2-Edge-Coloring of a Graph.”)
In case you are interested...
I have gathered a bunch of my all time favorite quotes.