معرفی
Zeev Dvir is a Professor jointly appointed in the Department of Computer Science and the Department of Mathematics at Princeton University. His research interests span theoretical computer science, discrete mathematics, and their intersections with algebra and combinatorics. He focuses on computational complexity, pseudo-randomness, coding theory, and combinatorial geometry.
Notable contributions include work on the Kakeya conjecture in finite fields, incidence theorems, and applications to coding theory. He has published extensively in top venues such as computational complexity conferences and journals. His work has been highlighted in Quanta Magazine for its impact on geometric problems.
Zeev Dvir holds grants from the National Science Foundation (NSF), including awards for research on dimension expanders and line-point incidence problems. His research also intersects with areas like matrix rigidity and data structure lower bounds. He maintains an active research program and collaborates on foundational questions in theoretical computer science and mathematics.
His homepage hosts surveys on incidence theorems and their applications, reflecting his commitment to bridging algebraic methods with discrete geometry. He is a prominent figure in the Princeton academic community, contributing to both departments through teaching and interdisciplinary research.
