Olaf Beyersdorff

	2011
45		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov: Parameterized Bounded-Depth Frege Is Not Optimal. ICALP (1) 2011: 630-641
44		Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer: Verifying Proofs in Constant Depth. MFCS 2011: 84-95
43		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: Parameterized Complexity of DPLL Search Procedures. SAT 2011: 5-18
42		Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer: Proof complexity of propositional default logic. Arch. Math. Log. 50(7-8): 727-742 (2011)
41		Olaf Beyersdorff, Johannes Köbler, Sebastian Müller: Proof systems that take advice. Inf. Comput. 209(3): 320-332 (2011)
40		Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer: Model Checking CTL is Almost Always Inherently Sequential Logical Methods in Computer Science 7(2): (2011)
39		Olaf Beyersdorff, Zenon Sadowski: Do there exist complete sets for promise classes? Math. Log. Q. 57(6): 535-550 (2011)
	2010
38		Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer: Proof Complexity of Propositional Default Logic. SAT 2010: 30-43
37		Olaf Beyersdorff: Proof Complexity of Non-classical Logics. TAMC 2010: 15-27
36		Olaf Beyersdorff, Sebastian Müller: Different Approaches to Proof Systems. TAMC 2010: 50-59
35		Olaf Beyersdorff, Sebastian Müller: A tight Karp-Lipton collapse result in bounded arithmetic. ACM Trans. Comput. Log. 11(4): (2010)
34		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov: Parameterized Bounded-Depth Frege is Not Optimal. Electronic Colloquium on Computational Complexity (ECCC) 17: 198 (2010)
33		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: Hardness of Parameterized Resolution. Electronic Colloquium on Computational Complexity (ECCC) 17: 59 (2010)
32		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games. Electronic Colloquium on Computational Complexity (ECCC) 17: 81 (2010)
31		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Inf. Process. Lett. 110(23): 1074-1077 (2010)
30		Olaf Beyersdorff: The Deduction Theorem for Strong Propositional Proof Systems. Theory Comput. Syst. 47(1): 162-178 (2010)
	2009
29		Olaf Beyersdorff, Yevgen Nebesov: Edges as Nodes - a New Approach to Timetable Information . ATMOS 2009
28		Olaf Beyersdorff, Zenon Sadowski: Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. CSR 2009: 47-58
27		Olaf Beyersdorff, Johannes Köbler, Sebastian Müller: Nondeterministic Instance Complexity and Proof Systems with Advice. LATA 2009: 164-175
26		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64
25		Olaf Beyersdorff, Sebastian Müller: Does Advice Help to Prove Propositional Tautologies? SAT 2009: 65-72
24		Olaf Beyersdorff: On the Existence of Complete Disjoint NP-Pairs. SYNASC 2009: 282-289
23		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider: Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28
22		Olaf Beyersdorff: Comparing axiomatizations of free pseudospaces. Arch. Math. Log. 48(7): 625-641 (2009)
21		Olaf Beyersdorff, Zenon Sadowski: Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. Electronic Colloquium on Computational Complexity (ECCC) 16: 81 (2009)
20		Olaf Beyersdorff, Johannes Köbler, Sebastian Müller: Proof Systems that Take Advice. Electronic Colloquium on Computational Complexity (ECCC) 16: 92 (2009)
19		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009)
18		Olaf Beyersdorff: On the correspondence between arithmetic theories and propositional proof systems - a survey. Math. Log. Q. 55(2): 116-137 (2009)
17		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)
	2008
16		Olaf Beyersdorff, Sebastian Müller: A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. CSL 2008: 199-214
15		Olaf Beyersdorff: Logical Closure Properties of Propositional Proof Systems. TAMC 2008: 318-329
14		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic CoRR abs/0808.3884: (2008)
13		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Propositional Implication CoRR abs/0811.0959: (2008)
12		Olaf Beyersdorff, Johannes Köbler, Sebastian Müller: Nondeterministic Instance Complexity and Proof Systems with Advice. Electronic Colloquium on Computational Complexity (ECCC) 15(075): (2008)
11		Olaf Beyersdorff: Tuples of Disjoint NP-Sets. Theory Comput. Syst. 43(2): 118-135 (2008)
	2007
10		Olaf Beyersdorff: The Deduction Theorem for Strong Propositional Proof Systems. FSTTCS 2007: 241-252
9		Olaf Beyersdorff: Classes of representable disjoint NP-pairs. Theor. Comput. Sci. 377(1-3): 93-109 (2007)
	2006
8		Olaf Beyersdorff: Tuples of Disjoint NP-Sets. CSR 2006: 80-91
7		Olaf Beyersdorff: Disjoint NP-Pairs from Propositional Proof Systems. TAMC 2006: 236-247
6		Olaf Beyersdorff: On the Deduction Theorem and Complete Disjoint NP-Pairs. Electronic Colloquium on Computational Complexity (ECCC) 13(142): (2006)
5		Olaf Beyersdorff: Disjoint NP-pairs and propositional proof systems. Humboldt University of Berlin 2006
	2005
4		Olaf Beyersdorff: Disjoint NP-Pairs from Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(083): (2005)
3		Olaf Beyersdorff: Tuples of Disjoint NP-Sets Electronic Colloquium on Computational Complexity (ECCC)(123): (2005)
	2004
2		Olaf Beyersdorff: Representable Disjoint NP-Pairs. FSTTCS 2004: 122-134
1		Olaf Beyersdorff: Representable Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC)(082): (2004)

Coauthor Index

1	Samir Datta	[44]
2	Nicola Galesi	[31] [32] [33] [34] [43] [45]
3	Johannes Köbler	[12] [17] [20] [27] [41]
4	Massimo Lauria	[31] [32] [33] [34] [43] [45]
5	Meena Mahajan	[44]
6	Arne Meier	[13] [14] [19] [23] [26] [38] [40] [42]
7	Jochen Messner (Jochen Meßner)	[17]
8	Sebastian Müller	[12] [16] [20] [25] [27] [35] [36] [38] [41] [42]
9	Martin Mundhenk	[23] [40]
10	Yevgen Nebesov	[29]
11	Alexander A. Razborov	[34] [45]
12	Zenon Sadowski	[21] [28] [39]
13	Gido Scharfenberger-Fabian	[44]
14	Thomas Schneider	[23] [40]
15	Karteek Sreenivasaiah	[44]
16	Michael Thomas	[13] [14] [19] [23] [26] [38] [40] [42] [44]
17	Heribert Vollmer	[13] [14] [19] [23] [26] [38] [40] [42] [44]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page