Past Member

Avishay Tal

Affiliation
Mathematics
Field of Study
Theoretical Computer Science
From 9/2015 – 7/2017:

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
  • Mathematics
9/20157/2017
Degrees
The Weizmann Institute of Science Ph.D., 2015