| 2009 |
|---|
| 46 | EE | Matthias Hagen,
Peter Horatschek,
Martin Mundhenk:
Experimental comparison of the two Fredman-Khachiyan-algorithms.
ALENEX 2009: 154-161 |
| 45 | EE | 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) |
| 2008 |
|---|
| 44 | EE | 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) |
| 43 | EE | Martin Mundhenk,
Thomas Schneider,
Thomas Schwentick,
Volker Weber:
Complexity of Hybrid Logics over Transitive Frames
CoRR abs/0806.4130: (2008) |
| 42 | EE | 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) |
| 41 | EE | 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) |
| 40 | EE | Judy Goldsmith,
Matthias Hagen,
Martin Mundhenk:
Complexity of DNF minimization and isomorphism testing for monotone formulas.
Inf. Comput. 206(6): 760-775 (2008) |
| 2007 |
|---|
| 39 | EE | Judy Goldsmith,
Martin Mundhenk:
Competition Adds Complexity.
NIPS 2007 |
| 38 | EE | Martin Mundhenk,
Thomas Schneider:
Undecidability of Multi-modal Hybrid Logics.
Electr. Notes Theor. Comput. Sci. 174(6): 29-43 (2007) |
| 2006 |
|---|
| 37 | EE | 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 |
|---|
| 36 | EE | Judy 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 |
|---|
| 34 | EE | Gerd Hoff,
Martin Mundhenk:
Creating a virtual library with HPSearch and Mops.
IuK 2001 |
| 33 | EE | Gerd Hoff,
Martin Mundhenk:
Finding scientific papers with homepagesearch and MOPS.
SIGDOC 2001: 201-207 |
| 32 | EE | Christopher 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 |
| 30 | EE | Vikraman Arvind,
Johannes Köbler,
Martin Mundhenk,
Jacobo Torán:
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.
STACS 2000: 314-323 |
| 29 | EE | Martin Mundhenk,
Judy Goldsmith,
Christopher Lusena,
Eric Allender:
Complexity of finite-horizon Markov decision process problems.
J. ACM 47(4): 681-720 (2000) |
| 28 | EE | Martin Mundhenk:
The Complexity of Optimal Small Policies.
Math. Oper. Res. 25(1): 118-129 (2000) |
| 27 | EE | Martin 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 |
|---|
| 21 | EE | Judy Goldsmith,
Martin Mundhenk:
Complexity Issues in Markov Decision Processes.
IEEE Conference on Computational Complexity 1998: 272-280 |
| 20 | EE | Michael L. Littman,
Judy Goldsmith,
Martin Mundhenk:
The Computational Complexity of Probabilistic Planning
CoRR cs.AI/9808101: (1998) |
| 19 | EE | Michael 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 |
| 17 | EE | Martin 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 |
| 14 | EE | Judy 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 |
| 10 | EE | Vikraman 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 |
|---|
| 2 | EE | 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 |
