The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Josh Buresh-Oppenheim: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Josh Buresh-Oppenheim, Tsuyoshi Morioka
    Relativized NP Search Problems and Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:54-67 [Conf]
  2. Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
    Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:583-592 [Conf]
  3. Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
    Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:318-0 [Conf]
  4. Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
    Homogenization and the Polynominal Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:926-937 [Conf]
  5. Josh Buresh-Oppenheim, Toniann Pitassi
    The Complexity of Resolution Refinements. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:138-0 [Conf]
  6. Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
    Homogenization and the polynomial calculus. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:91-108 [Journal]
  7. Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi
    Linear and Negative Resolution are Weaker than Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:074, pp:- [Journal]
  8. Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
    Bounded-depth Frege lower bounds for weaker pigeonhole principles [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:023, pp:- [Journal]
  9. Josh Buresh-Oppenheim, Tsuyoshi Morioka
    Relativized NP Search Problems and Propositional Proof Systems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:084, pp:- [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002