The SCEAS System
Navigation Menu

Search the dblp DataBase


Jochen Messner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johannes Köbler, Jochen Messner
    Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:132-140 [Conf]
  2. Johannes Köbler, Jochen Messner
    Is the Standard Proof System for SAT P-Optimal? [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:361-372 [Conf]
  3. Juan Luis Esteban, Nicola Galesi, Jochen Messner
    On the Complexity of Resolution with Bounded Conjunctions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:220-231 [Conf]
  4. Jochen Messner
    On the Structure of the Simulation Order of Proof Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:581-592 [Conf]
  5. Dieter Kranzlmüller, Jochen Messner, Christian Schaubschläger
    "Good Enough" Testing of Nondeterministic Parallel Programs. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:641-646 [Conf]
  6. Johannes Köbler, Jochen Messner, Jacobo Torán
    Optimal proof systems imply complete sets for promise classes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:71-92 [Journal]
  7. Juan Luis Esteban, Nicola Galesi, Jochen Messner
    On the complexity of resolution with bounded conjunctions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:347-370 [Journal]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002