Paul Beame - Concepedia

Author

Paul Beame

Also Known As

Beame, Paul, P Beame, P. Beame, P. W. Beame, P.W. Beame, PAUL BEAME, Paul Beame, Paul Beame, Joseph Culberson, David Mitchell, Cristopher Moore, Paul W. Beame

169

Publications

5.4K

Citations

H-Index

Concepts

All Affiliations

University of Washington University of Toronto University of California San Diego Rutgers, The State University of New Jersey University of Pittsburgh

About

Paul Beame is an author at University of Washington specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	34	64	4.4K
2	Education	2	2	41
3	Arts	1	1	44
4	Business	1	1	16
5	Language Studies	1	1	286

Paul Beame

Publications

4.9K

Citations

H-Index

Page 1

	Year	Citations
Model checking large software specifications Richard Anderson, Paul Beame, S.M. Burns, Software MaintenanceEngineeringVerificationSymbolic Model CheckingSoftware Engineering	1996	308
Towards Understanding and Harnessing the Potential of Clause Learning Paul Beame, Henry Kautz, Ashish Sabharwal Journal of Artificial Intelligence Research EngineeringVerificationAutomated ProofComputational ComplexityFormal Verification	2004	286
Log Depth Circuits for Division and Related Problems Paul Beame, Stephen Cook, H. James Hoover SIAM Journal on Computing Circuit ComplexityMathematical ProgrammingComputational Complexity TheoryEngineeringBoolean Function	1986	237
Exponential lower bounds for the pigeonhole principle Toniann Pitassi, Paul Beame, Russell Impagliazzo Computational Complexity EngineeringLower BoundExponential Lower BoundsComputational ComplexityExtremal Combinatorics	1993	197
Model checking large software specifications W. K. Chan, Richard Anderson, Paul Beame, IEEE Transactions on Software Engineering Software MaintenanceEngineeringVerificationSymbolic Model CheckingSoftware Engineering	1998	197
Simplified and improved resolution lower bounds Paul Beame, Toniann Pitassi Mathematical ProgrammingEngineeringAutomated ProofComputational ComplexitySuper-resolution Imaging	2002	195
Optimal Bounds for the Predecessor Problem and Related Problems Paul Beame, Faith E. Fich Journal of Computer and System Sciences Mathematical ProgrammingEngineeringLower BoundCombinatorial ProblemComputational Complexity	2002	188
Combining Component Caching and Clause Learning for Effective Model Counting. Tian Sang, Fahiem Bacchus, Paul Beame, EngineeringMachine LearningComputational ComplexityStatistical Relational LearningSimple Caching	2004	181
The Relative Complexity of NP Search Problems Paul Beame, Stephen Cook, Jeff Edmonds, Journal of Computer and System Sciences Computational Complexity TheoryEngineeringRelative ComplexityComputational ComplexityP Versus Np Problem	1998	176
Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs Paul Beame, Russell Impagliazzo, Jan Krajı́ček, Proceedings of the London Mathematical Society Algebraic EquationsEngineeringCommutative AlgebraAutomated ReasoningProof Complexity	1996	164

Page 1