Avishay Tal is a member of Berkeley's Theory Group. He received his Ph.D. in 2015 from the Weizmann Institute of Science under the guidance of Ran Raz. Prior to that, he was a student of mathematics and software engineering at Technion Institute under the guidance of Amir Shpilka. He has held postdoctoral appointments at the Institute for Advanced Study (hosted by Avi Wigderson), Simons Institute (as part of the Lower Bounds in Computational Complexity program), and Stanford University (hosted by Omer Reingold). His research interests are in computational complexity, analysis of boolean functions, circuit complexity, formula complexity, query complexity, pseudorandomness, learning, combinatorics, quantum computing, and the connections between algorithms and lower bounds.