Martin Mundhenk Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Hagen, Peter Horatschek, Martin Mundhenk: Experimental comparison of the two Fredman-Khachiyan-algorithms. ALENEX 2009: 154-161
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne 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
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne 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)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne 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)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Thomas Schneider: The Complexity of Hybrid Logics over Equivalence Relations. Journal of Logic, Language and Information 18(4): 493-514 (2009)
2008
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of Hybrid Logics over Transitive Frames CoRR abs/0806.4130: (2008)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne 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)
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJudy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206(6): 760-775 (2008)
2007
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJudy Goldsmith, Martin Mundhenk: Competition Adds Complexity. NIPS 2007
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Thomas Schneider: Undecidability of Multi-modal Hybrid Logics. Electr. Notes Theor. Comput. Sci. 174(6): 29-43 (2007)
2006
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens 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
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJudy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421
2002
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Meinel, Martin Mundhenk: Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung, 2. Auflage Teubner 2002
2001
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGerd Hoff, Martin Mundhenk: Creating a virtual library with HPSearch and Mops. IuK 2001
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGerd Hoff, Martin Mundhenk: Finding scientific papers with homepagesearch and MOPS. SIGDOC 2001: 201-207
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. (JAIR) 14: 83-103 (2001)
2000
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Meinel, Martin Mundhenk: Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung Teubner 2000
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán: Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of finite-horizon Markov decision process problems. J. ACM 47(4): 681-720 (2000)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk: The Complexity of Optimal Small Policies. Math. Oper. Res. 25(1): 118-129 (2000)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk: On hard instances. Theor. Comput. Sci. 242(1-2): 301-311 (2000)
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes Universität Trier, Mathematik/Informatik, Forschungsbericht 00-12: (2000)
1999
26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk: Propositional Proofs and Their Complexity Universität Trier, Mathematik/Informatik, Forschungsbericht 99-21: (1999)
25no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk: The complexity of optimal small policies Universität Trier, Mathematik/Informatik, Forschungsbericht 99-22: (1999)
24no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of Finite-Horizon Markov Decision process Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-25: (1999)
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGerd Hoff, Martin Mundhenk: Finding Scientific Papers with HPSearch and MOPS Universität Trier, Mathematik/Informatik, Forschungsbericht 99-26: (1999)
1998
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJudy Goldsmith, Martin Mundhenk: Complexity Issues in Markov Decision Processes. IEEE Conference on Computational Complexity 1998: 272-280
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning CoRR cs.AI/9808101: (1998)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. (JAIR) 9: 1-36 (1998)
1997
19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristoph Meinel, Carsten Damm, Martin Mundhenk: 33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung 1997: 624-625
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Anna Slobodová: Optimal Non-approximability of MAXCLIQUE. Lectures on Proof Verification and Approximation Algorithms 1997: 235-248
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Judy Goldsmith, Eric Allender: The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997: 129-138
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk: NP-Hard Sets Have Many Hard Instances. MFCS 1997: 428-437
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJudy Goldsmith, Michael L. Littman, Martin Mundhenk: The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI 1997: 182-189
1996
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Johannes Köbler, Martin Mundhenk: Monotonous and Randomized Reductions to Sparse Sets. ITA 30(2): 155-179 (1996)
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Johannes Köbler, Martin Mundhenk: Upper Bounds for the Complexity of Sparse and Tally Descriptions. Mathematical Systems Theory 29(1): 63-94 (1996)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJudy Goldsmith, Matthew A. Levy, Martin Mundhenk: Limited nondeterminism. SIGACT News 27(2): 20-29 (1996)
1995
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk: On Monotonous Oracle Machines. LATIN 1995: 436-448
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Johannes Köbler, Martin Mundhenk: On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. 56(2): 109-114 (1995)
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk: Monotonous Oracle Machines Universität Trier, Mathematik/Informatik, Forschungsbericht 95-02: (1995)
1994
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk: On Self-Reducible Sets of Low Information Content. CIAC 1994: 203-212
1993
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Johannes Köbler, Martin Mundhenk: Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS 1993: 232-241
1992
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Johannes Köbler, Martin Mundhenk: On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. FSTTCS 1992: 140-151
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman 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
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Johannes Köbler, Martin Mundhenk: Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC 1992: 249-258
1991
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Rainer Schuler: Random languages for nonuniform complexity classes. J. Complexity 7(3): 296-310 (1991)
1990
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mundhenk, Rainer Schuler: Non-Uniform Complexity Classes and Random Languages. Structure in Complexity Theory Conference 1990: 110-119

Coauthor Index

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

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)