Generate a tailored SOP for Dr. Ran Raz. Improve your application with a focused, well-structured draft.
Ran Raz joined the Princeton faculty in 2017. His main research area is complexity theory, with an emphasis on proving lower bounds for computational models. He is specifically interested in Boolean arithmetic circuit complexity, communication complexity, propositional proof theory, probabilistically checkable proofs, quantum computation communication, randomness, and derandomization. He completed his Ph.D. in mathematics at the Hebrew University of Jerusalem. Before joining Princeton, he spent several years as a postdoctoral fellow at Princeton and joined the faculty of the Weizmann Institute of Science. He was also a visiting professor at the Institute for Advanced Study from 2012 to 2016.
Princeton University • Princeton, NJ
Joining the faculty in the area of complexity theory.
GRE scores are not accepted. Ph.D. is the primary degree; students are not required to hold an M.S.E. prior to admission.