J. Buresh-Oppenheim, P. Beame, R. Raz., T. Pitassi and A. Sabharwal, Lower Bounds for Weaker Pigeonhole Principles, in Proceedings of the 43rd IEEE Symposium on the Foundations of Computer Science (FOCS), November 2002, pp. 583-592. Also in SIAM Journal on Computing: volume 34, issue 2, 2005 (PDF).
J. Buresh-Oppenheim and T. Pitassi, The Complexity of Resolution Refinements, in Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS), June 2003, pp. 138-147 (PDF).
J. Buresh-Oppenheim, N. Galesi, S. Hoory, A. Magen and T. Pitassi, Rank Bounds and Integrality Gaps for Cutting Planes Procedures, in Proceedings of the 44th IEEE Symposium on the Foundations of Computer Science (FOCS), October 2003, pp. 318-327. Also in Theory of Computing: volume 2, 2006, pp. 65-90 (PDF).
J. Buresh-Oppenheim and T. Morioka, Relativized NP Search Problems and Propositional Proof Complexity, in Proceedings of the 19th IEEE Conference on Computational Complexity (CCC), June 2004, pp. 54-67 (PDF).
M. Alekhnovich, A. Borodin, J. Buresh-Oppenheim, R. Impagliazzo,
A. Magen and T. Pitassi,
Towards a Model for Backtracking and Dynamic Programming,
in Proceedings of the 20th IEEE Conference on Computational
Complexity (CCC), June 2005
(PDF).
Coming soon: journal version.
J. Buresh-Oppenheim and R. Santhanam, Making Hard Problems Harder, in Proceedings of the 21st IEEE Conference on Computational Complexity (CCC), July 2006 (PDF).
J. Buresh-Oppenheim and D. Mitchell, Minimum Witnesses for Unsatisfiable 2CNFs, in Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT), August 2006 (PDF).
J. Buresh-Oppenheim, V. Kabanets and R. Santhanam, Uniform Hardness Amplification in NP via Monotone Codes, ECCC Technical Report TR06-154, December 2006 (PDF).
J. Buresh-Oppenheim and D. Mitchell,
Minimum 2CNF Resolution Refutations in Polynomial Time,
to appear in SAT 2007
(PDF).
Coming soon: journal version encompassing SAT 06 and 07 papers.