Paul Beame

Citée par

	Toutes	Depuis 2019
Citations	8167	2089
indice h	47	24
indice i10	92	50

420

210

105

315

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202428 41 54 60 53 79 80 90 127 99 133 142 191 220 199 219 203 217 235 308 320 295 248 205 230 286 224 255 309 314 388 377 362 405 341 342 262

Accès public

Tout afficher

15 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Richard J. AndersonProfessor of Computer Science and Engineering, University of WashingtonAdresse e-mail validée de cs.washington.edu
Henry KautzProfessor Emeritus of Computer Science, University of RochesterAdresse e-mail validée de cs.rochester.edu
Dan SuciuUniversity of WashingtonAdresse e-mail validée de cs.washington.edu
Ashish SabharwalAllen Institute for AI (AI2)Adresse e-mail validée de allenai.org
Stephen CookDepartment of Computer Science, University of TorontoAdresse e-mail validée de cs.toronto.edu
Walter L. RuzzoProfessor, University of WashingtonAdresse e-mail validée de uw.edu
Michael MolloyUniversity of TorontoAdresse e-mail validée de cs.toronto.edu
Guy Van den BroeckProfessor and Samueli Fellow, UCLAAdresse e-mail validée de cs.ucla.edu
Fahiem BacchusProfessor of Computer Science, University of TorontoAdresse e-mail validée de cs.toronto.edu
Jerry LiMicrosoft ResearchAdresse e-mail validée de microsoft.com
Jeff EdmondsYork UniversityAdresse e-mail validée de cse.yorku.ca
Soren RiisQueen Mary University of LondonAdresse e-mail validée de qmul.ac.uk
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityAdresse e-mail validée de uu.nl
Philipp WoelfelUniversity of CalgaryAdresse e-mail validée de ucalgary.ca
Raphael CliffordUniversity of BristolAdresse e-mail validée de cs.bris.ac.uk
Srikanth SrinivasanDepartment of Computer Science, University of CopenhagenAdresse e-mail validée de di.ku.dk
Cristopher MooreSanta Fe InstituteAdresse e-mail validée de santafe.edu
Atri RudraKatherine Johnson Chair in AI, Professor, CSE, University at BuffaloAdresse e-mail validée de buffalo.edu
Richard E LadnerUniversity of WashingtonAdresse e-mail validée de cs.washington.edu
Marcin KikInstitute of Mathematics and Computer Science, Wroclaw Univeristy of TechnologyAdresse e-mail validée de pwr.wroc.pl

Suivre

Paul Beame

Professor of Computer Science and Engineering, University of Washington

Adresse e-mail validée de cs.washington.edu - Page d'accueil

Computational Complexity Proof Complexity


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Towards understanding and harnessing the potential of clause learning P Beame, H Kautz, A Sabharwal Journal of artificial intelligence research 22, 319-351, 2004	412	2004
Log depth circuits for division and related problems PW Beame, SA Cook, HJ Hoover SIAM Journal on Computing 15 (4), 994-1003, 1986	409	1986
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	398	1998
Communication steps for parallel query processing P Beame, P Koutris, D Suciu Journal of the ACM (JACM) 64 (6), 1-58, 2017	369	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	327	2004
Optimal bounds for decision problems on the CRCW PRAM P Beame, J Hastad Journal of the ACM (JACM) 36 (3), 643-670, 1989	310	1989
Performing Bayesian inference by weighted model counting T Sang, P Beame, HA Kautz AAAI 5, 475-481, 2005	283	2005
Simplified and improved resolution lower bounds P Beame, T Pitassi Proceedings of 37th Conference on Foundations of Computer Science, 274-282, 1996	276	1996
Exponential lower bounds for the pigeonhole principle T Pitassi, P Beame, R Impagliazzo Computational complexity 3, 97-140, 1993	234	1993
Propositional proof complexity: Past, present and future P Beame, T Pitassi Bulletin of the EATCS 65, 66-89, 1998	233	1998
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	210	1995
Optimal bounds for the predecessor problem and related problems P Beame, FE Fich Journal of Computer and System Sciences 65 (1), 38-72, 2002	208	2002
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	174	1996
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	149	2002
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	149	1998
Skew in parallel query processing P Beame, P Koutris, D Suciu Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014	148	2014
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	144	1989
A switching lemma primer P Beame Technical Report UW-CSE-95-07-01, Department of Computer Science and …, 1994	139	1994
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	135	1992
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

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs