Past Member

Paul Beame

Funding provided by the Ellentuck Fund; Funding provided by the National Science Foundation

Affiliation

Mathematics

Field of Study

Computational Complexity

Home Institution

University of Washington
From
-

Paul Beame’s research focuses on lower bounds on the complexity of solving concrete computational problems. He plans to study several such lower bound questions involving time-space tradeoffs, proof complexity (particularly the complexity of semi-algebraic inference), and communication complexity.

Dates at IAS

Member
School of Mathematics

Degrees

University of Toronto
Ph.D.
1987
University of Toronto
M.Sc.
1982
University of Toronto
B.Sc.
1981

Appointments

University of Washington
1993–1999
Associate Professor
University of Washington
1987–1993
Assistant Professor