| 2008 | ||
|---|---|---|
| 9 | EE | Olaf Beyersdorff: Logical Closure Properties of Propositional Proof Systems. TAMC 2008: 318-329 |
| 2007 | ||
| 8 | EE | Olaf Beyersdorff: The Deduction Theorem for Strong Propositional Proof Systems. FSTTCS 2007: 241-252 |
| 7 | EE | Olaf Beyersdorff: Classes of representable disjoint NP-pairs. Theor. Comput. Sci. 377(1-3): 93-109 (2007) |
| 2006 | ||
| 6 | EE | Olaf Beyersdorff: Tuples of Disjoint NP-Sets. CSR 2006: 80-91 |
| 5 | EE | Olaf Beyersdorff: Disjoint NP-Pairs from Propositional Proof Systems. TAMC 2006: 236-247 |
| 2005 | ||
| 4 | EE | Olaf Beyersdorff: Disjoint NP-Pairs from Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(083): (2005) |
| 3 | EE | Olaf Beyersdorff: Tuples of Disjoint NP-Sets Electronic Colloquium on Computational Complexity (ECCC)(123): (2005) |
| 2004 | ||
| 2 | EE | Olaf Beyersdorff: Representable Disjoint NP-Pairs. FSTTCS 2004: 122-134 |
| 1 | EE | Olaf Beyersdorff: Representable Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC)(082): (2004) |