← Leaderboards
Paul W Beame
University Of Washington
$4,207,784
Attributed
$5,585,636
Total exposure
13
Grants
13
Lead (contact PI)
Attributed= this PI's even-split share of every grant they're on (the fair, additive number). Exposure = full size of all those grants.
Funding over time
peak $1.3M · FY2005–24$2M$1.5M$1M$500K$0
'05
'06
'07
'08
'09
'10
'11
'12
'13
'14
'15
'16
'17
'18
'19
'20
'21
'22
'23
'24
Funding mix
By agency
NSF$5,585,636 · 13
By mechanism
—$5,585,636 · 13
Top collaborators
- Aram W Harrow2 shared
- Dave M Bacon1 shared
- Henry A Kautz1 shared
Grant awards (13)
FET: Small: Quantum Time-Space Tradeoffs and Classical Lifting$600,000
· FY2024 · CSE · contact PI
AF: Small: Complexity of Representations for Inference$350,000
· FY2020 · CSE · contact PI
SHF: Small: Efficient Verification of Nonlinear Arithmetic$458,000
· FY2017 · CSE · contact PI
AF: Small: Communication and Resource Tradeoffs$400,000
· FY2015 · CSE · contact PI
AF: Small:Tradeoffs among Measures in Computational and Proof Complexity$440,000
· FY2012 · CSE · contact PI
AF: Large: Collaborative Research: Reliable Quantum Communication and Computation in the Presence of Noise$1,318,337
· FY2011 · CSE · contact PI
Travel Support for IEEE Symposium on Foundations of Computer Science (FOCS 2011)$12,000
· FY2011 · CSE · contact PI
Travel Support for the Symposium on Foundations of Computer Science (FOCS 2010)$15,000
· FY2010 · CSE · contact PI
AF: Small: Graph Isomorphism and Quantum Random Walks by Anyons$507,922
· FY2009 · CSE · contact PI
Semi-algebraic complexity and models for massive data set processing$497,377
· FY2008 · CSE · contact PI
Communication Complexity, Proof Complexity, and Approximation$200,000
· FY2005 · CSE · contact PI
ITR: Inference in AI, Verification, and Theory: A Unified Approach$490,000
· FY2002 · CSE · contact PI
Lower Bounds for Time-space Tradeoffs, Data Structures, and Proof Complexity$297,000
· FY2001 · CSE · contact PI