Regular biography
Dor Minzer is an associate professor of mathematics at the Massachusetts Institute of Technology. His research focuses on combinatorics, theoretical computer science, and computational complexity theory, with particular emphasis on probabilistically checkable proofs and Boolean function analysis. Minzer has contributed to significant problems in complexity theory, including the proof of the 2-to-2 Games Conjecture. He has received several awards, including the 2019 ACM Dissertation Award, a 2021 Sloan Research Fellowship, and the 2022 Presburger Award. Minzer earned his bachelor’s and PhD degrees from Tel-Aviv University and completed a postdoc at the Institute for Advanced Study.