Martin Mundhenk

	2012
65		Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss: The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers CoRR abs/1204.1196: (2012)
	2011
64		Martin Mundhenk, Robert Zeranski: How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms. SAT 2011: 105-119
63		Martin Mundhenk, Felix Weiß: The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. STACS 2011: 368-379
62		Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. 12(2): 13 (2011)
61		Judy Goldsmith, Christopher Lusena, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes CoRR abs/1106.0242: (2011)
60		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)
59		Martin Mundhenk, Felix Weiss: Intuitionistic implication makes model checking hard Logical Methods in Computer Science 8(2): (2011)
	2010
58		Martin Mundhenk, Felix Weiß: The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions. RP 2010: 146-160
57		Martin Mundhenk, Felix Weiss: The Model Checking Problem for Propositional Intuitionistic Logic with One Variable is AC1-Complete CoRR abs/1012.3828: (2010)
56		Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss: The complexity of satisfiability for fragments of hybrid logic - Part I. J. Applied Logic 8(4): 409-421 (2010)
55		Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of hybrid logics over transitive frames. J. Applied Logic 8(4): 422-440 (2010)
	2009
54		Matthias Hagen, Peter Horatschek, Martin Mundhenk: Experimental comparison of the two Fredman-Khachiyan-algorithms. ALENEX 2009: 154-161
53		Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss: The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. MFCS 2009: 587-599
52		Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider: Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28
51		Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss: The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I CoRR abs/0906.1489: (2009)
50		Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. Electr. Notes Theor. Comput. Sci. 231: 277-292 (2009)
49		Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk: The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 20(5): 901-918 (2009)
48		Martin Mundhenk, Thomas Schneider: The Complexity of Hybrid Logics over Equivalence Relations. Journal of Logic, Language and Information 18(4): 493-514 (2009)
	2008
47		Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments CoRR abs/0805.0498: (2008)
46		Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of Hybrid Logics over Transitive Frames CoRR abs/0806.4130: (2008)
45		Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer: The Complexity of Satisfiability for Fragments of CTL and CTL*. Electr. Notes Theor. Comput. Sci. 223: 201-213 (2008)
44		Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electronic Colloquium on Computational Complexity (ECCC) 15(028): (2008)
43		Judy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206(6): 760-775 (2008)
	2007
42		Judy Goldsmith, Martin Mundhenk: Competition Adds Complexity. NIPS 2007
41		Martin Mundhenk, Thomas Schneider: Undecidability of Multi-modal Hybrid Logics. Electr. Notes Theor. Comput. Sci. 174(6): 29-43 (2007)
	2006
40		Christoph Meinel, Martin Mundhenk: Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 3. Auflage. Teubner 2006: 1-333
39		Clemens Beckstein, Peter Dittrich, Christian Erfurth, Dietmar Fey, Birgitta König-Ries, Martin Mundhenk, Harald Sack: SOGOS - A Distributed Meta Level Architecture for the Self-Organizing Grid of Services. MDM 2006: 82
	2005
38		Judy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421
	2002
37		Christoph Meinel, Martin Mundhenk: Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung, 2. Auflage Teubner 2002
	2001
36		Gerd Hoff, Martin Mundhenk: Creating a virtual library with HPSearch and Mops. IuK 2001
35		Gerd Hoff, Martin Mundhenk: Finding scientific papers with homepagesearch and MOPS. SIGDOC 2001: 201-207
34		Christopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. (JAIR) 14: 83-103 (2001)
	2000
33		Christoph Meinel, Martin Mundhenk: Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung Teubner 2000
32		Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán: Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323
31		Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of finite-horizon Markov decision process problems. J. ACM 47(4): 681-720 (2000)
30		Martin Mundhenk: The Complexity of Optimal Small Policies. Math. Oper. Res. 25(1): 118-129 (2000)
29		Martin Mundhenk: On hard instances. Theor. Comput. Sci. 242(1-2): 301-311 (2000)
28		Christopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes Universität Trier, Mathematik/Informatik, Forschungsbericht 00-12: (2000)
	1999
27		Martin Mundhenk: Propositional Proofs and Their Complexity Universität Trier, Mathematik/Informatik, Forschungsbericht 99-21: (1999)
26		Martin Mundhenk: The complexity of optimal small policies Universität Trier, Mathematik/Informatik, Forschungsbericht 99-22: (1999)
25		Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of Finite-Horizon Markov Decision process Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-25: (1999)
24		Gerd Hoff, Martin Mundhenk: Finding Scientific Papers with HPSearch and MOPS Universität Trier, Mathematik/Informatik, Forschungsbericht 99-26: (1999)
	1998
23		Judy Goldsmith, Martin Mundhenk: Complexity Issues in Markov Decision Processes. IEEE Conference on Computational Complexity 1998: 272-280
22		Michael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning CoRR cs.AI/9808101: (1998)
21		Michael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. (JAIR) 9: 1-36 (1998)
	1997
20		Christoph Meinel, Carsten Damm, Martin Mundhenk: 33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung 1997: 624-625
19		Martin Mundhenk, Anna Slobodová: Optimal Non-approximability of MAXCLIQUE. Lectures on Proof Verification and Approximation Algorithms 1997: 235-248
18		Martin Mundhenk, Judy Goldsmith, Eric Allender: The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997: 129-138
17		Martin Mundhenk: NP-Hard Sets Have Many Hard Instances. MFCS 1997: 428-437
16		Judy Goldsmith, Michael L. Littman, Martin Mundhenk: The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI 1997: 182-189
	1996
15		Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Monotonous and Randomized Reductions to Sparse Sets. ITA 30(2): 155-179 (1996)
14		Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Upper Bounds for the Complexity of Sparse and Tally Descriptions. Mathematical Systems Theory 29(1): 63-94 (1996)
13		Judy Goldsmith, Matthew A. Levy, Martin Mundhenk: Limited nondeterminism. SIGACT News 27(2): 20-29 (1996)
	1995
12		Martin Mundhenk: On Monotonous Oracle Machines. LATIN 1995: 436-448
11		Vikraman Arvind, Johannes Köbler, Martin Mundhenk: On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. 56(2): 109-114 (1995)
10		Martin Mundhenk: Monotonous Oracle Machines Universität Trier, Mathematik/Informatik, Forschungsbericht 95-02: (1995)
	1994
9		Martin Mundhenk: On Self-Reducible Sets of Low Information Content. CIAC 1994: 203-212
	1993
8		Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS 1993: 232-241
7		Martin Mundhenk: Hausdorff-Reduktionen zu Mengen mit geringem Informationsgehalt. Universität Ulm 1993: 1-87
	1992
6		Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf: Reductions to Sets of Low Information Content. Complexity Theory: Current Research 1992: 1-46
5		Vikraman Arvind, Johannes Köbler, Martin Mundhenk: On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. FSTTCS 1992: 140-151
4		Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf: Reductions to Sets of Low Information Content. ICALP 1992: 162-173
3		Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC 1992: 249-258
	1991
2		Martin Mundhenk, Rainer Schuler: Random languages for nonuniform complexity classes. J. Complexity 7(3): 296-310 (1991)
	1990
1		Martin Mundhenk, Rainer Schuler: Non-Uniform Complexity Classes and Random Languages. Structure in Complexity Theory Conference 1990: 110-119

Coauthor Index

1	Eric Allender	[18] [25] [31]
2	Vikraman Arvind	[3] [4] [5] [6] [8] [11] [14] [15] [32]
3	Michael Bauland	[44] [47] [50] [62]
4	Clemens Beckstein	[39]
5	Olaf Beyersdorff	[52] [60]
6	Carsten Damm	[20]
7	Peter Dittrich	[39]
8	Christian Erfurth	[39]
9	Dietmar Fey	[39]
10	Judy Goldsmith	[13] [16] [18] [21] [22] [23] [25] [28] [31] [34] [38] [42] [43] [61]
11	Stefan Göller	[65]
12	Matthias Hagen	[38] [43] [54]
13	Yenjo Han	[4] [6]
14	Lane A. Hemaspaandra (Lane A. Hemachandra)	[4] [6]
15	Gerd Hoff	[24] [35] [36]
16	Peter Horatschek	[54]
17	Johannes Köbler	[3] [4] [5] [6] [8] [11] [14] [15] [32]
18	Birgitta König-Ries	[39]
19	Matthew A. Levy	[13]
20	Michael L. Littman	[16] [21] [22]
21	Antoni Lozano	[4] [6]
22	Christopher Lusena	[25] [28] [31] [34] [61]
23	Arne Meier	[45] [49] [51] [52] [53] [56] [60] [65]
24	Christoph Meinel	[20] [33] [37] [40]
25	Mitsunori Ogihara (Mitsunori Ogiwara)	[4] [6]
26	Harald Sack	[39]
27	Thomas Schneider	[41] [44] [46] [47] [48] [50] [51] [52] [53] [55] [56] [60] [62] [65]
28	Henning Schnoor	[44] [47] [50] [62]
29	Ilka Schnoor	[44] [47] [50] [62]
30	Uwe Schöning	[4] [6]
31	Rainer Schuler	[1] [2]
32	Thomas Schwentick	[46] [55]
33	Riccardo Silvestri	[4] [6]
34	Anna Slobodová	[19]
35	Thomas Thierauf	[4] [6]
36	Michael Thomas	[45] [49] [51] [52] [53] [56] [60] [65]
37	Jacobo Torán	[32]
38	Heribert Vollmer	[44] [45] [47] [49] [50] [52] [60] [62]
39	Volker Weber	[46] [51] [53] [55] [56]
40	Felix Weiss (Felix Weiß)	[51] [53] [56] [57] [58] [59] [63] [65]
41	Robert Zeranski	[64]

Colors in the list of coauthors

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page