| 2011 |
|---|
| 32 | Towards Understanding and Harnessing the Potential of Clause Learning. Paul Beame, Henry A. Kautz, Ashish Sabharwal. CoRR (abs/1107.0044) (2011). Web SearchBibTeXDownload |
| 2009 |
|---|
| 31 | Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword. Paul Beame, Amit Chakrabarti. Computational Complexity (18): 169-170 (2009). Web SearchBibTeXDownload |
| 2007 |
|---|
| 30 | A Dynamic Approach for MPE and Weighted MAX-SAT. Tian Sang, Paul Beame, Henry A. Kautz. IJCAI 2007, 173-179. Web SearchBibTeXDownload |
| 29 | Lower bounds for randomized read/write stream algorithms. Paul Beame, T. S. Jayram, Atri Rudra. STOC 2007, 689-698. Web SearchBibTeXDownload |
| 2005 |
|---|
| 28 | Performing Bayesian Inference by Weighted Model Counting. Tian Sang, Paul Beame, Henry A. Kautz. AAAI 2005, 475-482. Web SearchBibTeX |
| 27 | The resolution complexity of random graph k-colorability. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. Discrete Applied Mathematics (153): 25-47 (2005). Web SearchBibTeXDownload |
| 26 | Heuristics for Fast Exact Model Counting. Tian Sang, Paul Beame, Henry A. Kautz. SAT 2005, 226-240. Web SearchBibTeXDownload |
| 2004 |
|---|
| 25 | The Resolution Complexity of Random Graph k-Colorability. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. Electronic Colloquium on Computational Complexity (ECCC) 2004. Web SearchBibTeXDownload |
| 24 | Towards Understanding and Harnessing the Potential of Clause Learning. Paul Beame, Henry A. Kautz, Ashish Sabharwal. J. Artif. Intell. Res. (JAIR) (22): 319-351 (2004). Web SearchBibTeXDownload |
| 23 | A sharp threshold in proof complexity yields lower bounds for satisfiability search. Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy. J. Comput. Syst. Sci. (68): 238-268 (2004). Web SearchBibTeXDownload |
| 22 | Combining Component Caching and Clause Learning for Effective Model Counting. Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi. SAT 2004. Web SearchBibTeXDownload |
| 21 | Exponential bounds for DPLL below the satisfiability threshold. Dimitris Achlioptas, Paul Beame, Michael Molloy. SODA 2004, 139-140. Web SearchBibTeXDownload |
| 2003 |
|---|
| 20 | Understanding the Power of Clause Learning. Paul Beame, Henry A. Kautz, Ashish Sabharwal. IJCAI 2003, 1194-1201. Web SearchBibTeX |
| 19 | Time-space trade-off lower bounds for randomized computation of decision problems. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. J. ACM (50): 154-195 (2003). Web SearchBibTeXDownload |
| 18 | Using Problem Structure for Efficient Clause Learning. Ashish Sabharwal, Paul Beame, Henry A. Kautz. SAT 2003, 242-256. Web SearchBibTeXDownload |
| 2002 |
|---|
| 17 | Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. Paul Beame, Erik Vee. IEEE Conference on Computational Complexity 2002, 18. Web SearchBibTeXDownload |
| 16 | The Efficiency of Resolution and Davis--Putnam Procedures. Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks. SIAM J. Comput. (31): 1048-1075 (2002). Web SearchBibTeXDownload |
| 15 | Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. Paul Beame, Erik Vee. STOC 2002, 688-697. Web SearchBibTeXDownload |
| 2001 |
|---|
| 14 | Time-Space Tradeoffs for Branching Programs. Paul Beame, T. S. Jayram, Michael E. Saks. J. Comput. Syst. Sci. (63): 542-572 (2001). Web SearchBibTeXDownload |
| 13 | A sharp threshold in proof complexity. Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy. STOC 2001, 337-346. Web SearchBibTeXDownload |
| 2000 |
|---|
| 12 | Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. Electronic Colloquium on Computational Complexity (ECCC) (7) (2000). Web SearchBibTeXDownload |
| 11 | Super-linear time-space tradeoff lower bounds for randomized computation. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. FOCS 2000, 169-179. Web SearchBibTeXDownload |
| 1999 |
|---|
| 10 | A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa. SIAM J. Comput. (28): 1051-1072 (1999). Cited by 7Web SearchBibTeXDownload |
| 1998 |
|---|
| 9 | Time-Space Tradeoffs for Branching Programs. Paul Beame, T. S. Jayram, Michael E. Saks. FOCS (5): 254-263 (1998). Web SearchBibTeXDownload |
| 8 | The Relative Complexity of NP Search Problems. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. J. Comput. Syst. Sci. (57): 3-19 (1998). Web SearchBibTeXDownload |
| 7 | On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks. STOC 1998, 561-571. Web SearchBibTeXDownload |
| 1997 |
|---|
| 6 | Separating the Power of EREW and CREW PRAMs with Small Communication Width. Paul Beame, Faith E. Fich, Rakesh K. Sinha. Inf. Comput. (138): 89-99 (1997). Web SearchBibTeXDownload |
| 1996 |
|---|
| 5 | Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa. Inf. Comput. (130): 101-129 (1996). Cited by 7Web SearchBibTeXDownload |
| 1995 |
|---|
| 4 | The relative complexity of NP search problems. Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. STOC 1995, 303-314. Web SearchBibTeXDownload |
| 1993 |
|---|
| 3 | Separating the Power of EREW and CREW PRAMs with Small Communication Width. Paul Beame, Faith E. Fich, Rakesh K. Sinha. WADS 1993, 163-174. Web SearchBibTeXDownload |
| 1992 |
|---|
| 2 | The Complexity of Computing Symmetric Functions Using Threshold Circuits. Paul Beame, Erik Brisson, Richard E. Ladner. Theor. Comput. Sci. (100): 253-265 (1992). Web SearchBibTeXDownload |
| 1990 |
|---|
| 1 | Time-Space Tradeoffs for Undirected Graph Traversal. Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa. FOCS 1990, 429-438. Cited by 13Web SearchBibTeXDownload |
