Avishay Tal
Assistant ProfessorInfo Links
Research Areas
Theory (THY)Research Centers
Simons Institute for the Theory of Computing (SITC)Teaching Schedule
Fall 2020
CS 170. Efficient Algorithms and Intractable Problems, TuTh 3:30PM - 4:59PM, Internet/OnlineBiography
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.Education
2015, PhD, Computer Science, Weizmann Institute of Science2012, MS, Computer Science, Weizmann Institute of Science
2007, BA, Mathematics, The Technion, Haifa, Israel
2005, BS, Software Engineering, The Technion, Haifa, Israel