Avishay Tal is a postdoctoral researcher in the Theoretical Computer Science and Discrete Mathematics group at the Institute for Advanced Study. He obtained his Ph.D. in 2015 from the Weizmann Institute of Science, under the guidance of Ran Raz. His thesis title was “Analysis of Boolean Functions in Theoretical Computer Science.”
His research interests include complexity theory, analysis of Boolean functions, circuit and formula lower bounds, decision-tree complexity, pseudorandomness, and the relationship between algorithms and complexity.