Paul Beame

Computational Theory and Mathematics · 2004–2005

A researcher in the Science corpus: 2 papers; trusts 7 researchers and is trusted by 4 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 7 citations into it; #7,281 of 12,182 by trust here, #8,756 by citations

Whom Paul Beame trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Matthew W. Moskewicz
2. Lintao Zhang
3. Judea Pearl
4. Adnan Darwiche
5. Sharad Malik
6. E. Goldberg

Who trusts Paul Beame overall

1. Vaishak Belle
2. Armin Biere
3. Martin Gebser
4. Guy Van den Broeck
5. Adnan Darwiche
6. Vibhav Gogate
7. Benjamin Kaufmann
8. Stuart J. Russell
9. Andrea Passerini
10. Jingyi Xu

Papers from Paul Beame's perspective

Ordered by how strongly the researchers Paul Beame trusts endorse each paper. Same corpus, a different order for every researcher.

1. Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
2. Probabilistic reasoning in intelligent systems - networks of plausible inference
3. A machine program for theorem-proving (CACM)
4. Efficient conflict driven learning in a Boolean satisfiability solver (IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281))
5. BerkMin: A fast and robust SAT-solver (Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition)
6. On the weak pigeonhole principle
7. Cha : Engineering an e cient SAT solver (Design Automation Conference)
8. Recursive conditioning (Artificial Intelligence)
9. GRASP: A Search Algorithm for Propositional Satisfiability
10. ImageNet classification with deep convolutional neural networks

Their papers

• Towards Understanding and Harnessing the Potential of Clause Learning (2004) — 339 citations
• Performing Bayesian Inference by Weighted Model Counting (2005) — 299 citations