Homogenization and the Polynominal Calculus. - Josh Buresh-Oppenheim; Matthew Clegg; Russell Impagliazzo; Toniann Pitassi (ICALP, 2000)

Linear and Negative Resolution are Weaker than Resolution - Josh Buresh-Oppenheim; David G. Mitchell; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2001)

Homogenization and the polynomial calculus. - Josh Buresh-Oppenheim; Matthew Clegg; Russell Impagliazzo; Toniann Pitassi (Comput. Complex., 2002)

Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. - Josh Buresh-Oppenheim; Nicola Galesi; Shlomo Hoory; Avner Magen; Toniann Pitassi (FOCS, 2003)

Relativized NP Search Problems and Propositional Proof Systems - Josh Buresh-Oppenheim; Tsuyoshi Morioka (Electron. Colloquium Comput. Complex., 2003)

Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. - Joshua Buresh-Oppenheim; Paul Beame; Toniann Pitassi; Ran Raz; Ashish Sabharwal (SIAM J. Comput., 2004)

Randomness in proof complexity. - Joshua Buresh-Oppenheim (2005)

Minimum Witnesses for Unsatisfiable 2CNFs. - Joshua Buresh-Oppenheim; David G. Mitchell (SAT, 2006)

Uniform Hardness Amplification in NP via Monotone Codes. - Joshua Buresh-Oppenheim; Valentine Kabanets; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2006)

Making Hard Problems Harder - Joshua Buresh-Oppenheim; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2006)

Rank Bounds and Integrality Gaps for Cutting Planes Procedures. - Joshua Buresh-Oppenheim; Nicola Galesi; Shlomo Hoory; Avner Magen; Toniann Pitassi (Theory Comput., 2006)

Minimum 2CNF Resolution Refutations in Polynomial Time. - Joshua Buresh-Oppenheim; David G. Mitchell (SAT, 2007)

The complexity of resolution refinements. - Joshua Buresh-Oppenheim; Toniann Pitassi (J. Symb. Log., 2007)

Toward a Model for Backtracking and Dynamic Programming. - Michael Alekhnovich; Allan Borodin; Joshua Buresh-Oppenheim; Russell Impagliazzo; Avner Magen (Electron. Colloquium Comput. Complex., 2009)

A Stronger Model of Dynamic Programming Algorithms. - Joshua Buresh-Oppenheim; Sashka Davis; Russell Impagliazzo (Algorithmica, 2011)

Toward a Model for Backtracking and Dynamic Programming. - Michael Alekhnovich; Allan Borodin; Joshua Buresh-Oppenheim; Russell Impagliazzo; Avner Magen; Toniann Pitassi (Comput. Complex., 2011)