☰

Paul W. Beame

Affiliations: 
University of Washington, Seattle, Seattle, WA 
Area:
Computer Science
Google:
"Paul Beame"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Steven A. Cook grad student 1987 University of Toronto

Children

Sign in to add trainee
Erik Vee grad student 2004 University of Washington
Ashish Sabharwal grad student 2005 University of Washington
Tian Sang grad student 2008 University of Washington
Dang-Trinh Huynh-Ngoc grad student 2011 University of Washington
Widad Machmouchi grad student 2013 University of Washington
David J. Rosenbaum grad student 2015 University of Washington (Physics Tree)

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Beame P, Gharan SO, Yang X. (2020) On the Bias of Reed--Muller Codes over Odd Prime Fields Siam Journal On Discrete Mathematics. 34: 1232-1247
Beame P, Liew V. (2019) Toward Verifying Nonlinear Integer Arithmetic Journal of the Acm. 66: 22
Beame P, Koutris P, Suciu D. (2017) Communication Steps for Parallel Query Processing Journal of the Acm. 64: 40
Beame P, Li J, Roy S, et al. (2017) Exact Model Counting of Query Expressions Acm Transactions On Database Systems. 42: 1-46
Beame P, Grosshans N, McKenzie P, et al. (2016) Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method Acm Transactions On Computation Theory. 9: 1-34
Beame P, Huynh T. (2012) The Value of Multiple Read/Write Streams for Approximating Frequency Moments Acm Transactions On Computation Theory. 3: 6
Beame P, Beck C, Impagliazzo R. (2012) Time-space tradeoffs in resolution: Superpolynomial lower bounds for superlinear space Proceedings of the Annual Acm Symposium On Theory of Computing. 213-231
Beame P, Huynh T. (2012) Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremath{\sfAC}^0$ Siam Journal On Computing. 41: 484-518
Beame P, David M, Pitassi T, et al. (2010) Separating Deterministic from Randomized Multiparty Communication Complexity Theory of Computing. 6: 201-225
Beame P, Impagliazzo R, Pitassi T, et al. (2010) Formula caching in DPLL Acm Transactions On Computation Theory. 1
See more...