Joshua Buresh-Oppenheim

Josh Buresh-Oppenheim

2007
17	EE	Joshua Buresh-Oppenheim, David G. Mitchell: Minimum 2CNF Resolution Refutations in Polynomial Time. SAT 2007: 300-313
2006
16	EE	Joshua Buresh-Oppenheim, Rahul Santhanam: Making Hard Problems Harder. IEEE Conference on Computational Complexity 2006: 73-87
15	EE	Joshua Buresh-Oppenheim, David G. Mitchell: Minimum Witnesses for Unsatisfiable 2CNFs. SAT 2006: 42-47
14	EE	Joshua Buresh-Oppenheim, Rahul Santhanam: Making Hard Problems Harder Electronic Colloquium on Computational Complexity (ECCC)(003): (2006)
13	EE	Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam: Uniform Hardness Amplification in NP via Monotone Codes. Electronic Colloquium on Computational Complexity (ECCC) 13(154): (2006)
12	EE	Joshua 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
11	EE	Michael 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
10	EE	Josh Buresh-Oppenheim, Tsuyoshi Morioka: Relativized NP Search Problems and Propositional Proof Systems. IEEE Conference on Computational Complexity 2004: 54-67
9	EE	Joshua 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
8	EE	Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi: Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS 2003: 318-
7	EE	Josh Buresh-Oppenheim, Toniann Pitassi: The Complexity of Resolution Refinements. LICS 2003: 138-
6	EE	Josh Buresh-Oppenheim, Tsuyoshi Morioka: Relativized NP Search Problems and Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(084): (2003)
2002
5	EE	Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. FOCS 2002: 583-592
4	EE	Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi: Homogenization and the polynomial calculus. Computational Complexity 11(3-4): 91-108 (2002)
3	EE	Josh 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
2	EE	Josh 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
1	EE	Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi: Homogenization and the Polynominal Calculus. ICALP 2000: 926-937

Coauthor Index

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

Colors in the list of coauthors