Paul Beame

Cited by

	All	Since 2018
Citations	7697	2044
h-index	46	24
i10-index	91	48

400

200

100

300

19881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202329 34 49 64 55 73 78 89 129 98 123 122 178 232 201 217 212 214 234 322 320 290 246 205 229 276 234 279 305 317 399 365 370 398 361 148

Public access

View all

15 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Russell ImpagliazzoUC, San DiegoVerified email at eng.ucsd.edu
Richard J. AndersonProfessor of Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Henry KautzProfessor Emeritus of Computer Science, University of RochesterVerified email at cs.rochester.edu
Dan SuciuUniversity of WashingtonVerified email at cs.washington.edu
Ashish SabharwalAllen Institute for AI (AI2)Verified email at allenai.org
Paraschos KoutrisUniversity of WashingtonVerified email at cs.washington.edu
Stephen CookDepartment of Computer Science, University of TorontoVerified email at cs.toronto.edu
Walter L. RuzzoProfessor, University of WashingtonVerified email at uw.edu
Michael MolloyUniversity of TorontoVerified email at cs.toronto.edu
Guy Van den BroeckAssociate Professor and Samueli Fellow, UCLAVerified email at cs.ucla.edu
Fahiem BacchusProfessor of Computer Science, University of TorontoVerified email at cs.toronto.edu
Jerry LiMicrosoft ResearchVerified email at microsoft.com
Jeff EdmondsYork UniversityVerified email at cse.yorku.ca
Soren RiisQueen Mary University of LondonVerified email at qmul.ac.uk
Philipp WoelfelUniversity of CalgaryVerified email at ucalgary.ca
Raphael CliffordUniversity of BristolVerified email at cs.bris.ac.uk
Srikanth SrinivasanDepartment of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityVerified email at uu.nl
Cristopher MooreSanta Fe InstituteVerified email at santafe.edu
Atri RudraProfessor, CSE, University at BuffaloVerified email at buffalo.edu

Paul Beame

Professor of Computer Science and Engineering, University of Washington

Verified email at cs.washington.edu - Homepage

Computational Complexity Proof Complexity


Title Sort by citations Sort by year Sort by 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	391	1998
Log depth circuits for division and related problems PW Beame, SA Cook, HJ Hoover SIAM Journal on Computing 15 (4), 994-1003, 1986	388	1986
Towards understanding and harnessing the potential of clause learning P Beame, H Kautz, A Sabharwal Journal of artificial intelligence research 22, 319-351, 2004	383	2004
Communication steps for parallel query processing P Beame, P Koutris, D Suciu Journal of the ACM (JACM) 64 (6), 1-58, 2017	305	2017
Combining Component Caching and Clause Learning for Effective Model Counting. T Sang, F Bacchus, P Beame, HA Kautz, T Pitassi SAT 4, 7th, 2004	302	2004
Optimal bounds for decision problems on the CRCW PRAM P Beame, J Hastad Journal of the ACM (JACM) 36 (3), 643-670, 1989	300	1989
Simplified and improved resolution lower bounds P Beame, T Pitassi Proceedings of 37th Conference on Foundations of Computer Science, 274-282, 1996	266	1996
Performing Bayesian inference by weighted model counting T Sang, P Beame, HA Kautz AAAI 5, 475-481, 2005	258	2005
Propositional Proof complexity: Past, Present P Beame, T Pitassi Future, 42-70, 2001	228	2001
Exponential lower bounds for the pigeonhole principle T Pitassi, P Beame, R Impagliazzo Computational complexity 3, 97-140, 1993	226	1993
Optimal bounds for the predecessor problem and related problems P Beame, FE Fich Journal of Computer and System Sciences 65 (1), 38-72, 2002	204	2002
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	197	1995
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	167	1996
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	147	1998
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	144	2002
Skew in parallel query processing P Beame, P Koutris, D Suciu Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014	140	2014
Optimal bounds for the predecessor problem P Beame, FE Fich Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing …, 1999	134	1999
A switching lemma primer P Beame Technical Report UW-CSE-95-07-01, Department of Computer Science and …, 1994	133	1994
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	133	1989
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	133	1989

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors