Published on *Computer Science Department at Princeton University* (http://www.cs.princeton.edu)

Title/Position

Associate Professor

Degree

Ph.D., Weizmann Institute of Science, 2008

zdvir (@cs.princeton.edu)
(609) 258-0255
405 Computer Science

Homepage

Other Affiliations

**Interests:** Computational complexity, pseudo-randomness, coding theory and

discrete mathematics.

Alfred P. Sloan Research Fellowship, 2013; NSF CAREER Award, 2013; SIAM Dénes König Prize, 2012.

**Research Areas:**

Zeev Dvir, an assistant professor in the computer science and mathematics departments, received his Ph.D. in 2008 from the Weizmann Institute of Science in Rehovot, Israel, and did post-doctoral work at the Institute for Advanced Study. He has a broad interest in theoretical computer science and mathematics, with special attention to computational complexity, pseudo-randomness, coding theory and discrete geometry. He was awarded an Alfred P. Sloan Foundation Research Fellowship in 2013. In 2012, he won the *Dénes König* award from the SIAM Conference on Discrete Mathematics, and in 2011 was awarded the Alfred Rheinstein ’11 award, given each year to an assistant professor in the School of Engineering who has shown exceptional promise.

- “On the size of Kakeya sets in finite fields.” Z. Dvir. Journal of the American Mathematical Society. 22:1093-1097, 2009.
- “Breaking the quadratic barrier for 3-LCCs over the reals.” Z. Dvir, S. Saraf and A. Wigderson. Proceedings of the ACM Symposium on the Theory of Computing (STOC), 2014.
- “Fractional Sylvester-Gallai theorems.” B. Barak, Z. Dvir, A. Wigderson and A. Yehudayoff. Proceedings of the National Academy of Sciences, 2012.
- “Subspace evasive sets.” Z. Dvir and S. Lovett. Proceedings of the ACM Symposium on the Theory of Computing (STOC), 2012. Pp. 351-358.