Past Member
Avishay Tal
Funding provided by the Simons Foundation and the National Science Foundation
From
–
Avishay Tal’s interests include complexity theory, analysis of Boolean functions, circuit and formula lower bounds, decision tree complexity, pseudorandomness, and the relation between algorithms and complexity. The aim of his work is proving lower bounds for computational tasks in restricted models.
Dates at IAS
Member
School of Mathematics
–
Degrees
The Weizmann Institute of Science
Ph.D.
2015
Appointments
UC Berkeley
2019
Assistant Professor
Stanford University
2017–2019
Motwani Postdoctoral Fellow
