- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Paul Beame, Henry A. Kautz, Ashish Sabharwal
- J. Artif. Intell. Res.
- 2004

Effcient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problems, such as… (More)

While there has been very substantial progress in practical algorithms for satisfiability, there are many related logical problems where satisfiability alone is not enough. One particularly useful… (More)

- Paul Beame, Faith Ellen
- J. Comput. Syst. Sci.
- 2002

We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost… (More)

- Paul Beame, Paraschos Koutris, Dan Suciu
- PODS
- 2013

We consider the problem of computing a relational query q on a large input database of size n, using a large number p of servers. The computation is performed in rounds, and each server can receive… (More)

- William Chan, Richard J. Anderson, +4 authors Jon Damon Reese
- IEEE Trans. Software Eng.
- 1998

In this paper we prove an exponential lower bound on the size of bounded-depth Frege proofs for the pigeonhole principle (PHP). We also obtain an Ω(loglogn)-depth lower bound for any polynomial-sized… (More)

- Paul Beame, Stephen A. Cook, H. James Hoover
- FOCS
- 1984

We present optimal depth Boolean circuits (depth O(log n)) for integer division, powering, and multiple products. We also show that these three problems are of equivalent uniform depth and space… (More)

- Paul Beame, Johan Håstad
- STOC
- 1987

We prove optimal &OHgr;(log <italic>n</italic>/log log <italic>n</italic>) lower bounds on the time for CRCW PRAM's with polynomially bounded numbers of processors or memory cells to compute parity… (More)

- Paul Beame, Toniann Pitassi
- Proceedings of 37th Conference on Foundations of…
- 1996

We give simple new lower bounds on the lengths of resolution proofs for the pigeonhole principle and for randomly generated formulas. For random formulas, our bounds significantly extend the range of… (More)

- Paul Beame, Paraschos Koutris, Dan Suciu
- PODS
- 2014

We study the problem of computing a conjunctive query q in parallel, using p of servers, on a large database. We consider algorithms with one round of communication, and study the complexity of the… (More)