Paul Beame
Paul Beame
Professor of Computer Science and Engineering, University of Washington
Verified email at cs.washington.edu - Homepage
Title
Cited by
Cited by
Year
Model checking large software specifications
W Chan, RJ Anderson, P Beame, S Burns, F Modugno, D Notkin, ...
IEEE Transactions on software Engineering 24 (7), 498-520, 1998
3671998
Log depth circuits for division and related problems
PW Beame, SA Cook, HJ Hoover
SIAM Journal on Computing 15 (4), 994-1003, 1986
3531986
Towards understanding and harnessing the potential of clause learning
P Beame, H Kautz, A Sabharwal
Journal of Artificial Intelligence Research 22, 319-351, 2004
3292004
Optimal bounds for decision problems on the CRCW PRAM
P Beame, J Hastad
Journal of the ACM (JACM) 36 (3), 643-670, 1989
2931989
Simplified and improved resolution lower bounds
P Beame, T Pitassi
Proceedings of 37th Conference on Foundations of Computer Science, 274-282, 1996
2361996
Combining Component Caching and Clause Learning for Effective Model Counting.
T Sang, F Bacchus, P Beame, HA Kautz, T Pitassi
SAT 4, 7th, 2004
2322004
Performing Bayesian inference by weighted model counting
T Sang, P Beame, HA Kautz
AAAI 5, 475-481, 2005
2082005
Propositional Proof complexity: Past, Present
P Beame, T Pitassi
Future, 42-70, 2001
2052001
Communication steps for parallel query processing
P Beame, P Koutris, D Suciu
Journal of the ACM (JACM) 64 (6), 1-58, 2017
2022017
Exponential lower bounds for the pigeonhole principle
T Pitassi, P Beame, R Impagliazzo
Computational complexity 3 (2), 97-140, 1993
1891993
Optimal bounds for the predecessor problem and related problems
P Beame, FE Fich
Journal of Computer and System Sciences 65 (1), 38-72, 2002
1822002
The relative complexity of NP search problems
P Beame, S Cook, J Edmonds, R Impagliazzo, T Pitassi
Journal of Computer and System Sciences 57 (1), 3-19, 1998
1541998
The Relative Complexity of NP Search Problems
P Beame, S Cook, J Edmonds, R Impagliazzo, T Pitassi
Journal of Computer and System Sciences 57 (1), 3-19, 1998
1541998
On the complexity of unsatisfiability proofs for random k-CNF formulas
P Beame, R Karp, T Pitassi, M Saks
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
1371998
Lower bounds on Hilbert's Nullstellensatz and propositional proofs
P Beame, R Impagliazzo, J Krajíček, T Pitassi, P Pudlák
Proceedings of the London Mathematical Society 3 (1), 1-26, 1996
1351996
The efficiency of resolution and Davis--Putnam procedures
P Beame, R Karp, T Pitassi, M Saks
SIAM Journal on Computing 31 (4), 1048-1075, 2002
1342002
Optimal bounds for the predecessor problem
P Beame, FE Fich
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
1291999
Exponential lower bounds for the pigeonhole principle
P Beame, R Impagliazzo, J Krajíček, T Pitassi, P Pudlák, A Woods
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
1261992
A switching lemma primer
P Beame
Technical Report UW-CSE-95-07-01, Department of Computer Science and …, 1994
1251994
Understanding the power of clause learning
P Beame, H Kautz, A Sabharwal
IJCAI, 1194-1201, 2003
1192003
The system can't perform the operation now. Try again later.
Articles 1–20