Sledovat
Paul Beame
Paul Beame
Professor of Computer Science and Engineering, University of Washington
E-mailová adresa ověřena na: cs.washington.edu - Domovská stránka
Název
Citace
Citace
Rok
Towards understanding and harnessing the potential of clause learning
P Beame, H Kautz, A Sabharwal
Journal of artificial intelligence research 22, 319-351, 2004
4082004
Log depth circuits for division and related problems
PW Beame, SA Cook, HJ Hoover
SIAM Journal on Computing 15 (4), 994-1003, 1986
4071986
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
3961998
Communication steps for parallel query processing
P Beame, P Koutris, D Suciu
Journal of the ACM (JACM) 64 (6), 1-58, 2017
3632017
Combining Component Caching and Clause Learning for Effective Model Counting.
T Sang, F Bacchus, P Beame, HA Kautz, T Pitassi
SAT 4, 7th, 2004
3182004
Optimal bounds for decision problems on the CRCW PRAM
P Beame, J Hastad
Journal of the ACM (JACM) 36 (3), 643-670, 1989
3091989
Performing Bayesian inference by weighted model counting
T Sang, P Beame, HA Kautz
AAAI 5, 475-481, 2005
2772005
Simplified and improved resolution lower bounds
P Beame, T Pitassi
Proceedings of 37th Conference on Foundations of Computer Science, 274-282, 1996
2771996
Exponential lower bounds for the pigeonhole principle
T Pitassi, P Beame, R Impagliazzo
Computational complexity 3, 97-140, 1993
2331993
Propositional proof complexity: Past, present and future
P Beame, T Pitassi
Bulletin of the EATCS 65, 66-89, 1998
2321998
The relative complexity of NP search problems
P Beame, S Cook, J Edmonds, R Impagliazzo, T Pitassi
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
2081995
Optimal bounds for the predecessor problem and related problems
P Beame, FE Fich
Journal of Computer and System Sciences 65 (1), 38-72, 2002
2072002
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
1731996
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
1502002
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
1491998
Skew in parallel query processing
P Beame, P Koutris, D Suciu
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014
1462014
A general sequential time-space tradeoff for finding unique elements
P Beame
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
1431989
A switching lemma primer
P Beame
Technical Report UW-CSE-95-07-01, Department of Computer Science and …, 1994
1391994
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
1351992
Optimal bounds for the predecessor problem
P Beame, FE Fich
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
1341999
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20