Jochen Messner

Jochen Meßner

	2009
12		Olaf Beyersdorff, Johannes Köbler, Jochen Messner: Nondeterministic functions and the existence of optimal proof systems. Theor. Comput. Sci. 410(38-40): 3839-3855 (2009)
	2004
11		Juan Luis Esteban, Nicola Galesi, Jochen Messner: On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321(2-3): 347-370 (2004)
	2003
10		Johannes Köbler, Jochen Messner, Jacobo Torán: Optimal proof systems imply complete sets for promise classes. Inf. Comput. 184(1): 71-92 (2003)
	2002
9		Juan Luis Esteban, Nicola Galesi, Jochen Messner: On the Complexity of Resolution with Bounded Conjunctions. ICALP 2002: 220-231
8		Jochen Messner: On the Structure of the Simulation Order of Proof Systems. MFCS 2002: 581-592
	2000
7		Johannes Köbler, Jochen Messner: Is the Standard Proof System for SAT P-Optimal? FSTTCS 2000: 361-372
	1999
6		Dieter Kranzlmüller, Jochen Messner, Christian Schaubschläger: "Good Enough" Testing of Nondeterministic Parallel Programs. PDPTA 1999: 641-646
5		Jochen Meßner: On Optimal Algorithms and Optimal Proof Systems. STACS 1999: 541-550
	1998
4		Johannes Köbler, Jochen Messner: Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. IEEE Conference on Computational Complexity 1998: 132-140
3		Jochen Meßner, Jacobo Torán: Optimal Proof Systems for Propositional Logic and Complete Sets. STACS 1998: 477-487
	1997
2		Jochen Meßner: Pattern Matching in Trace Monoids (Extended Abstract). STACS 1997: 571-582
1		Jochen Meßner, Jacobo Torán: Optimal proof systems for Propositional Logic and complete sets Electronic Colloquium on Computational Complexity (ECCC) 4(26): (1997)

Coauthor Index

1	Olaf Beyersdorff	[12]
2	Juan Luis Esteban	[9] [11]
3	Nicola Galesi	[9] [11]
4	Johannes Köbler	[4] [7] [10] [12]
5	Dieter Kranzlmüller	[6]
6	Christian Schaubschläger	[6]
7	Jacobo Torán	[1] [3] [10]

Colors in the list of coauthors