Jochen Messner

Publication Activity (10 Years)

Years Active: 1998-2017
Publications (10 Years): 2

Top Venues

ACM Trans. Comput. Theory

Electron. Colloquium Comput. Complex.

MFCS

ISAAC

University of Ulm, Germany (PHD)

Education History

University of Ulm, Germany

PHD

Publications

Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf
Exact Perfect Matching in Complete Graphs. ACM Trans. Comput. Theory 9 (2) (2017)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
Planarizing Gadgets for Perfect Matching Do Not Exist. ACM Trans. Comput. Theory 8 (4) (2016)
Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. ISAAC (2015)
Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. Electron. Colloquium Comput. Complex. 22 (2015)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf
Exact Perfect Matching in Complete Graphs. Electron. Colloquium Comput. Complex. 20 (2013)
Jochen Messner, Thomas Thierauf
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability. Theor. Comput. Sci. 461 (2012)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
Planarizing Gadgets for Perfect Matching Do Not Exist. MFCS (2012)
Jochen Messner, Thomas Thierauf
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability. COCOON (2011)
Jochen Messner, Thomas Thierauf
A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability. Electron. Colloquium Comput. Complex. 18 (2011)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
Planarizing Gadgets for Perfect Matching do not Exist. Electron. Colloquium Comput. Complex. 18 (2011)
Olaf Beyersdorff, Johannes Köbler, Jochen Messner
Nondeterministic functions and the existence of optimal proof systems. Theor. Comput. Sci. 410 (38-40) (2009)
Juan Luis Esteban, Nicola Galesi, Jochen Messner
On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321 (2-3) (2004)
Johannes Köbler, Jochen Messner, Jacobo Torán
Optimal proof systems imply complete sets for promise classes. Inf. Comput. 184 (1) (2003)
Juan Luis Esteban, Nicola Galesi, Jochen Messner
On the Complexity of Resolution with Bounded Conjunctions. ICALP (2002)
Jochen Messner
On the Structure of the Simulation Order of Proof Systems. MFCS (2002)
Johannes Köbler, Jochen Messner
Is the Standard Proof System for SAT P-Optimal? FSTTCS (2000)
Dieter Kranzlmüller, Jochen Messner, Christian Schaubschläger
"Good Enough" Testing of Nondeterministic Parallel Programs. PDPTA (1999)
Johannes Köbler, Jochen Messner
Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. Computational Complexity Conference (1998)

Jochen Messner.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jochen Messner