Omri Weinstein was appointed as Junior Fellow in 2015 as postdoctoral research scientist in the department of computer science at New York University. He resigned his fellowship after accepting a position as an assistant professor in the Theoretical Computer Science group at Columbia University. He completed his Ph.D. at Princeton University in 2015 under the supervision of Mark Braverman, and before that he earned a B.Sc. in mathematics and computer science from Tel Aviv University.
Omri’s primary research focus is communication complexity and applications of information theory to computational complexity, privacy, streaming and economics. His research in information complexity led to significant progress on some of the major open problems in communication and circuit complexity (the direct sum and product conjectures, and the KRW conjecture), and to a better understanding of the limits of parallel computation. His most recent research interest lies in the intersection between communication complexity and algorithmic game theory. His awards include the 2015 Siebel Scholarship and two graduate awards from the Simons Foundation.