Avishay Tal is a Motwani Postdoctoral Research Fellow at Stanford University, hosted by Omer Reingold. Prior to that, he was a postdoctoral researcher in the Theoretical Computer Science and Discrete Mathematics Group at the Institute for Advanced Study, hosted by Avi Wigderson. He obtained his PhD in 2015 from the Weizmann Institute of Science, under the guidance of Ran Raz. His research interests include complexity theory, analysis of Boolean functions, circuit and formula lower bounds, pseudorandomness, decision-tree complexity, and the relationship between algorithms and complexity.
- Lower Bounds in Computational Complexity, Fall 2018. Research Fellow.