dblp.uni-trier.dewww.uni-trier.de

Martin Mundhenk

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
46EEMatthias Hagen, Peter Horatschek, Martin Mundhenk: Experimental comparison of the two Fredman-Khachiyan-algorithms. ALENEX 2009: 154-161
45EEMichael 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)
2008
44EEMichael 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)
43EEMartin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of Hybrid Logics over Transitive Frames CoRR abs/0806.4130: (2008)
42EEArne 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)
41EEMichael 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)
40EEJudy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206(6): 760-775 (2008)
2007
39EEJudy Goldsmith, Martin Mundhenk: Competition Adds Complexity. NIPS 2007
38EEMartin Mundhenk, Thomas Schneider: Undecidability of Multi-modal Hybrid Logics. Electr. Notes Theor. Comput. Sci. 174(6): 29-43 (2007)
2006
37EEClemens 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
36EEJudy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421
2002
35 Christoph Meinel, Martin Mundhenk: Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung, 2. Auflage Teubner 2002
2001
34EEGerd Hoff, Martin Mundhenk: Creating a virtual library with HPSearch and Mops. IuK 2001
33EEGerd Hoff, Martin Mundhenk: Finding scientific papers with homepagesearch and MOPS. SIGDOC 2001: 201-207
32EEChristopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. (JAIR) 14: 83-103 (2001)
2000
31 Christoph Meinel, Martin Mundhenk: Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung Teubner 2000
30EEVikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán: Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323
29EEMartin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of finite-horizon Markov decision process problems. J. ACM 47(4): 681-720 (2000)
28EEMartin Mundhenk: The Complexity of Optimal Small Policies. Math. Oper. Res. 25(1): 118-129 (2000)
27EEMartin Mundhenk: On hard instances. Theor. Comput. Sci. 242(1-2): 301-311 (2000)
26 Christopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes Universität Trier, Mathematik/Informatik, Forschungsbericht 00-12: (2000)
1999
25 Martin Mundhenk: Propositional Proofs and Their Complexity Universität Trier, Mathematik/Informatik, Forschungsbericht 99-21: (1999)
24 Martin Mundhenk: The complexity of optimal small policies Universität Trier, Mathematik/Informatik, Forschungsbericht 99-22: (1999)
23 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)
22 Gerd Hoff, Martin Mundhenk: Finding Scientific Papers with HPSearch and MOPS Universität Trier, Mathematik/Informatik, Forschungsbericht 99-26: (1999)
1998
21EEJudy Goldsmith, Martin Mundhenk: Complexity Issues in Markov Decision Processes. IEEE Conference on Computational Complexity 1998: 272-280
20EEMichael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning CoRR cs.AI/9808101: (1998)
19EEMichael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. (JAIR) 9: 1-36 (1998)
1997
18 Christoph Meinel, Carsten Damm, Martin Mundhenk: 33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung 1997: 624-625
17EEMartin Mundhenk, Anna Slobodová: Optimal Non-approximability of MAXCLIQUE. Lectures on Proof Verification and Approximation Algorithms 1997: 235-248
16 Martin Mundhenk, Judy Goldsmith, Eric Allender: The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997: 129-138
15 Martin Mundhenk: NP-Hard Sets Have Many Hard Instances. MFCS 1997: 428-437
14EEJudy Goldsmith, Michael L. Littman, Martin Mundhenk: The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI 1997: 182-189
1996
13 Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Monotonous and Randomized Reductions to Sparse Sets. ITA 30(2): 155-179 (1996)
12 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)
1995
11 Martin Mundhenk: On Monotonous Oracle Machines. LATIN 1995: 436-448
10EEVikraman Arvind, Johannes Köbler, Martin Mundhenk: On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. 56(2): 109-114 (1995)
9 Martin Mundhenk: Monotonous Oracle Machines Universität Trier, Mathematik/Informatik, Forschungsbericht 95-02: (1995)
1994
8 Martin Mundhenk: On Self-Reducible Sets of Low Information Content. CIAC 1994: 203-212
1993
7 Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS 1993: 232-241
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
2EEMartin 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

1Eric Allender [16] [23] [29]
2Vikraman Arvind [3] [4] [5] [6] [7] [10] [12] [13] [30]
3Michael Bauland [41] [44] [45]
4Clemens Beckstein [37]
5Carsten Damm [18]
6Peter Dittrich [37]
7Christian Erfurth [37]
8Dietmar Fey [37]
9Judy Goldsmith [14] [16] [19] [20] [21] [23] [26] [29] [32] [36] [39] [40]
10Matthias Hagen [36] [40] [46]
11Yenjo Han [4] [6]
12Lane A. Hemaspaandra (Lane A. Hemachandra) [4] [6]
13Gerd Hoff [22] [33] [34]
14Peter Horatschek [46]
15Johannes Köbler [3] [4] [5] [6] [7] [10] [12] [13] [30]
16Birgitta König-Ries [37]
17Michael L. Littman [14] [19] [20]
18Antoni Lozano [4] [6]
19Christopher Lusena [23] [26] [29] [32]
20Arne Meier [42]
21Christoph Meinel [18] [31] [35]
22Mitsunori Ogihara (Mitsunori Ogiwara) [4] [6]
23Harald Sack [37]
24Thomas Schneider [38] [41] [43] [44] [45]
25Henning Schnoor [41] [44] [45]
26Ilka Schnoor [41] [44] [45]
27Uwe Schöning [4] [6]
28Rainer Schuler [1] [2]
29Thomas Schwentick [43]
30Riccardo Silvestri [4] [6]
31Anna Slobodová [17]
32Thomas Thierauf [4] [6]
33Michael Thomas [42]
34Jacobo Torán [30]
35Heribert Vollmer [41] [42] [44] [45]
36Volker Weber [43]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)