Avishay Tal
Research Areas
Research Centers
Teaching Schedule
Spring 2024
- CS 278. Machine-Based Complexity Theory, TuTh 14:00-15:29, Soda 405
- CS 298-2. Group Studies Seminars, or Group Research, We 12:00-13:29, Soda 438
Fall 2024
- CS 298-2. Group Studies Seminars, or Group Research, We 12:00-13:29, Soda 438
Biography
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 completed a Master's degree at the Technion 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.
Education
- 2015, PhD, Computer Science, Weizmann Institute of Science
- 2012, MS, Computer Science, The Technion, Haifa, Israel
- 2007, BA, Mathematics, The Technion, Haifa, Israel
- 2005, BS, Software Engineering, The Technion, Haifa, Israel
Awards, Memberships and Fellowships
- Sloan Research Fellow, 2022
