About the Authors
Zeev Dvir
Associate professor
Department of Mathematics and
Department of Computer Science
Princeton University, Princeton, NJ
zdvir[ta]princeton[td]edu
www.cs.princeton.edu/~zdvir
Associate professor
Department of Mathematics and
Department of Computer Science
Princeton University, Princeton, NJ
zdvir[ta]princeton[td]edu
www.cs.princeton.edu/~zdvir
Zeev Dvir was born in Jerusalem, Israel. He received his Ph.D.
from the Weizmann Institute in Israel
in 2008. His advisors were
Ran Raz and
Amir Shpilka. He has a
broad interest in theoretical computer science and mathematics and
especially in computational complexity, pseudorandomness, coding theory and discrete mathematics.
Benjamin L. Edelman
Ph.D. student
Department of Computer Science
Harvard University, Cambridge, MA
bedelman[ta]g[td]harvard[td]edu
benjaminedelman.com
Ph.D. student
Department of Computer Science
Harvard University, Cambridge, MA
bedelman[ta]g[td]harvard[td]edu
benjaminedelman.com
Benjamin L. Edelman is a Ph.D. student in computer science at Harvard University.
He is advised by Leslie Valiant. His
research interests include computational complexity, learning theory, and game theory. While an undergraduate at Princeton University, he did algebraic complexity research with Zeev Dvir and Ran Raz. His interest in theoretical computer science can be traced to
PACT, a high school
summer program run by the
extraordinary Rajiv Gandhi.