2008

Nondeterministic Functions and the Existence of Optimal Proof Systems
With Johannes Köbler and Jochen Messner
Submitted for publication.

Comparing Axiomatizations of Free Pseudospaces
Submitted for publication.

On the Correspondence Between Arithmetic Theories and Propositional Proof Systems - a Survey
Mathematical Logic Quarterly, To appear.

Tuples of Disjoint NP-Sets
Theory of Computing Systems, To appear.

Logical Closure Properties of Propositional Proof Systems
(Extended Abstract)
Proc. 5th Annual Conference on Theory and Applications of Models of Computation (TAMC), LNCS 4978, Pages 318-329, 2008.

2007

The Deduction Theorem for Strong Propositional Proof Systems
Proc. 27th Conference on Foundations of Software Technology & Theoretical Computer Science (FST&TCS), LNCS 4855, Pages 241-252, 2007.

Classes of Representable Disjoint NP-Pairs
Theoretical Computer Science, Volume 377, Issues 1-3, Pages 93-109, 2007.

2006

Disjoint NP-Pairs from propositional proof systems
(Extended Abstract)
Proc. 3rd Conference on Theory and Applications of Models of Computation (TAMC), Springer Verlag, LNCS 3959, 236-247, 2006.

Tuples of Disjoint NP-Sets
(Extended Abstract)
Proc. 1st International Computer Science Symposium in Russia (CSR), Springer Verlag, LNCS 3967, 80-91, 2006.

Disjoint NP-Pairs and Propositional Proof Systems
Dissertation, Humboldt-Universität zu Berlin, 2006.

Von der Turingmaschine zum Quantencomputer
(Zusammen mit Johannes Köbler)
Themen der Informatik im historischen Kontext, Springer Verlag, 2006.

The Deduction Theorem and Complete Disjoint NP-Pairs
Technical Report, Electronic Colloquium on Computational Complexity, TR06-142.

2005

Tuples of Disjoint NP-Sets
Technical Report, Electronic Colloquium on Computational Complexity, TR05-123.

Disjoint NP-Pairs from propositional proof systems
Technical Report, Electronic Colloquium on Computational Complexity, TR05-83.

2004

Representable Disjoint NP-Pairs
Proc. 24th Conference on Foundations of Software Technology & Theoretical Computer Science (FST&TCS), Springer-Verlag, LNCS  3328, 122-1344, 2004.

Representable Disjoint NP-Pairs
(Extended version of the above conference paper)
Technical Report, Electronic Colloquium on Computational Complexity, TR04-082.

2000

Eine stabile nicht äquationale Theorie
Diploma thesis (Diplomarbeit), Humboldt-Universität zu Berlin, 2000.

1996

Separation and Homology
Semester report, Mälardalens Högskola Västeras (Sweden), 1996.