My research interests include sublinear-time algorithms (in
particular, property testing), private data analysis, approximation
algorithms, randomized algorithms and complexity theory. I am a member of the theory group. I got my PhD from MIT in 2003. From the fall of 2003 to
2006, I worked at the Hebrew
University of Jerusalem, the
Weizmann Institute of Science and the Institute for Pure and Applied
Mathematics. In 2013--2014, I was on sabbatical leave at
Boston University for a special Privacy Year and also participated in the Privacy Tools project at Harvard University in Spring 2014.
If you are interested in joining our CSE graduate program, please look at http://www.eecs.psu.edu/students/graduate/EECS-Graduate-Prospective.aspx for information on admission and a description of the program. Research assistantships are available for strong candidates interested in working in algorithms and theory. Make sure to indicate "algorithms" or "theoretical computer science" or the name of a faculty member you are interested in working with if you want our group to consider you. Our department receives many applications, and I cannot review all of them personally.
Department of Computer Science and Engineering The Pennsylvania State University 343F Information Sciences and Technology Building University Park, PA 16803