The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo, Avner Magen, Toniann Pitassi
    Toward a Model for Backtracking and Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:308-322 [Conf]
  2. Joshua Buresh-Oppenheim, Rahul Santhanam
    Making Hard Problems Harder. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:73-87 [Conf]
  3. Joshua Buresh-Oppenheim, David G. Mitchell
    Minimum Witnesses for Unsatisfiable 2CNFs. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:42-47 [Conf]
  4. Joshua Buresh-Oppenheim, Rahul Santhanam
    Making Hard Problems Harder [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:003, pp:- [Journal]
  5. Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
    Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:261-276 [Journal]
  6. Joshua Buresh-Oppenheim, David G. Mitchell
    Minimum 2CNF Resolution Refutations in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:300-313 [Conf]

  7. Uniform Hardness Amplification in NP via Monotone Codes. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
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