Robert Robere is a recently minted PhD from the University of Toronto, where he was supervised by Toniann Pitassi and Stephen Cook. His research interests lie in computational complexity theory, and particularly in the theory of lower bounds for boolean circuits and propositional proof systems. He also has a long-standing interest in the theory of satisfiability and SAT solvers. After visiting the Simons Institute, he will be starting a two-year postdoc jointly between DIMACS (at Rutgers University) and the Institute for Advanced Study.
- Lower Bounds in Computational Complexity, Fall 2018. Research Fellow.