dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Joshua Buresh-Oppenheim Home Page Coauthor index pubzone.org

Josh Buresh-Oppenheim

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, Sashka Davis, Russell Impagliazzo: A Stronger Model of Dynamic Programming Algorithms. Algorithmica 60(4): 938-968 (2011)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi: Toward a Model for Backtracking and Dynamic Programming. Computational Complexity 20(4): 679-740 (2011)
2009
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen: Toward a Model for Backtracking and Dynamic Programming. Electronic Colloquium on Computational Complexity (ECCC) 16: 38 (2009)
2007
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, David G. Mitchell: Minimum 2CNF Resolution Refutations in Polynomial Time. SAT 2007: 300-313
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, Toniann Pitassi: The complexity of resolution refinements. J. Symb. Log. 72(4): 1336-1352 (2007)
2006
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, Rahul Santhanam: Making Hard Problems Harder. IEEE Conference on Computational Complexity 2006: 73-87
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, David G. Mitchell: Minimum Witnesses for Unsatisfiable 2CNFs. SAT 2006: 42-47
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, Rahul Santhanam: Making Hard Problems Harder Electronic Colloquium on Computational Complexity (ECCC)(003): (2006)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam: Uniform Hardness Amplification in NP via Monotone Codes. Electronic Colloquium on Computational Complexity (ECCC) 13(154): (2006)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi: Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory of Computing 2(1): 65-90 (2006)
2005
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi: Toward a Model for Backtracking and Dynamic Programming. IEEE Conference on Computational Complexity 2005: 308-322
2004
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, Tsuyoshi Morioka: Relativized NP Search Problems and Propositional Proof Systems. IEEE Conference on Computational Complexity 2004: 54-67
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. SIAM J. Comput. 34(2): 261-276 (2004)
2003
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi: Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS 2003: 318-327
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, Toniann Pitassi: The Complexity of Resolution Refinements. LICS 2003: 138-
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, Tsuyoshi Morioka: Relativized NP Search Problems and Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(084): (2003)
2002
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. FOCS 2002: 583-592
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi: Homogenization and the polynomial calculus. Computational Complexity 11(3-4): 91-108 (2002)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-depth Frege lower bounds for weaker pigeonhole principles Electronic Colloquium on Computational Complexity (ECCC)(023): (2002)
2001
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi: Linear and Negative Resolution are Weaker than Resolution Electronic Colloquium on Computational Complexity (ECCC) 8(074): (2001)
2000
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJosh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi: Homogenization and the Polynominal Calculus. ICALP 2000: 926-937

Coauthor Index

1Michael Alekhnovich [11] [19] [20]
2Paul Beame [3] [5] [9]
3Allan Borodin [11] [19] [20]
4Matthew Clegg [1] [4]
5Sashka Davis [21]
6Nicola Galesi [8] [12]
7Shlomo Hoory [8] [12]
8Russell Impagliazzo [1] [4] [11] [19] [20] [21]
9Valentine Kabanets [13]
10Avner Magen [8] [11] [12] [19] [20]
11David G. Mitchell [2] [15] [18]
12Tsuyoshi Morioka [6] [10]
13Toniann Pitassi [1] [2] [3] [4] [5] [7] [8] [9] [11] [12] [17] [20]
14Ran Raz [3] [5] [9]
15Ashish Sabharwal [3] [5] [9]
16Rahul Santhanam [13] [14] [16]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page