default search action
Joshua Buresh-Oppenheim
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j6]Joshua Buresh-Oppenheim, Sashka Davis, Russell Impagliazzo
:
A Stronger Model of Dynamic Programming Algorithms. Algorithmica 60(4): 938-968 (2011) - [j5]Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo
Toward a Model for Backtracking and Dynamic Programming. Comput. Complex. 20(4): 679-740 (2011)
2000 – 2009
- 2009
- [i6]Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen:
Toward a Model for Backtracking and Dynamic Programming. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [j4]Joshua Buresh-Oppenheim, Toniann Pitassi:
The complexity of resolution refinements. J. Symb. Log. 72(4): 1336-1352 (2007) - [c9]Joshua Buresh-Oppenheim, David G. Mitchell:
Minimum 2CNF Resolution Refutations in Polynomial Time. SAT 2007: 300-313 - 2006
- [j3]Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory Comput. 2(4): 65-90 (2006) - [c8]Joshua Buresh-Oppenheim, Rahul Santhanam:
Making Hard Problems Harder. CCC 2006: 73-87 - [c7]Joshua Buresh-Oppenheim, David G. Mitchell:
Minimum Witnesses for Unsatisfiable 2CNFs. SAT 2006: 42-47 - [i5]Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam:
Uniform Hardness Amplification in NP via Monotone Codes. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Joshua Buresh-Oppenheim, Rahul Santhanam:
Making Hard Problems Harder. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [b1]Joshua Buresh-Oppenheim:
Randomness in proof complexity. University of Toronto, Canada, 2005 - [c6]Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo
Toward a Model for Backtracking and Dynamic Programming. CCC 2005: 308-322 - 2004
- [j2]Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. SIAM J. Comput. 34(2): 261-276 (2004) - [c5]Josh Buresh-Oppenheim, Tsuyoshi Morioka:
Relativized NP Search Problems and Propositional Proof Systems. CCC 2004: 54-67 - 2003
- [c4]Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS 2003: 318-327 - [c3]Josh Buresh-Oppenheim, Toniann Pitassi:
The Complexity of Resolution Refinements. LICS 2003: 138- - [i3]Josh Buresh-Oppenheim, Tsuyoshi Morioka:
Relativized NP Search Problems and Propositional Proof Systems. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j1]Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo
Homogenization and the polynomial calculus. Comput. Complex. 11(3-4): 91-108 (2002) - [c2]Josh Buresh-Oppenheim, Paul Beame
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. FOCS 2002: 583-592 - [i2]Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal:
Bounded-depth Frege lower bounds for weaker pigeonhole principles. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [i1]Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi:
Linear and Negative Resolution are Weaker than Resolution. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c1]Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo
Homogenization and the Polynominal Calculus. ICALP 2000: 926-937
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: