Zeev Dvir

Zeev Dvir is a professor in the computer science and mathematics departments at Princeton University. He received his Ph.D. in 2008 from the Weizmann Institute of Science in Rehovot, Israel, and completed post-doctoral work at the Institute for Advanced Study. His research interests include theoretical computer science and mathematics, with a focus on computational complexity, pseudo-randomness, coding theory, and combinatorics.

Zeev Dvir is a theoretical computer scientist at Princeton University, specializing in complexity, theory, and math. His research focuses on fundamental problems in theoretical computer science, including complexity theory, combinatorics, and algebraic geometry. Dvir's work explores topics such as Kakeya sets, locally decodable codes, pseudorandomness, and matrix rigidity. He has made significant contributions to the understanding of polynomial sources, mergers, and extractors, as well as the design of efficient data structures and algorithms. His research often bridges theoretical computer science with mathematics, particularly in the areas of combinatorial geometry and algebraic complexity.