| 2012 | SAT | An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning. | Maria Luisa Bonet, Samuel R. Buss |
| 2009 | LFCS | The NP-Completeness of Reflected Fragments of Justification Logics. | Samuel R. Buss, Roman Kuznets |
| 2009 | VR | Efficient Large-Scale Sweep and Prune Methods with AABB Insertion and Removal. | Daniel J. Tracy, Samuel R. Buss, Bryan M. Woods |
| 2002 | FOCS | A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution. | Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo |
| 2000 | LICS | Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. | Samuel R. Buss, Bruce M. Kapron |
| 1999 | STOC | Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi |
| 1998 | MFCS | Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
| 1997 | CSL | Resolution and the Weak Pigeonhole Principle. | Samuel R. Buss, Toniann Pitassi |
| 1994 | CSL | How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. | Pavel Pudlk, Samuel R. Buss |
| 1994 | SODA | Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. | Samuel R. Buss, Peter N. Yianilos |
| 1991 | LICS | On the Deduction Rule and the Number of Proof Lines | Maria Luisa Bonet, Samuel R. Buss |
| 1990 | FOCS | On the Predictability of Coupled Automata: An Allegory about Chaos | Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis |
| 1987 | STOC | The Boolean Formula Value Problem Is in ALOGTIME | Samuel R. Buss |
| 1985 | STOC | The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract) | Samuel R. Buss |