Martin Mundhenk

Judy Goldsmith, Martin Mundhenk, J. Goldsmith, 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

Complexity of finite-horizon Markov decision process problems

Eric Allender, Martin Mundhenk, Judy Goldsmith, 2000, JACM.

Model Checking CTL is Almost Always Inherently Sequential

Arne Meier, Heribert Vollmer, Michael Thomas, 2009, 2009 16th International Symposium on Temporal Representation and Reasoning.

The Complexity of Hybrid Logics over Equivalence Relations

Martin Mundhenk, Thomas Schneider, 2009, J. Log. Lang. Inf..

The model checking fingerprints of CTL operators

Arne Meier, Andreas Krebs, Martin Mundhenk, 2015, 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME).

The Complexity of Satisfiability for Fragments of CTL and CTL*

Arne Meier, Heribert Vollmer, Michael Thomas, 2008, Int. J. Found. Comput. Sci..

Finding Scientific Papers with HPSearch and MOPS

Gerd Hoff, Martin Mundhenk, 1999, Universität Trier, Mathematik/Informatik, Forschungsbericht.

Model Checking CTL is Almost Always Inherently Sequential

Arne Meier, Heribert Vollmer, Michael Thomas, 2009, TIME.

Optimal Non-approximability of MAXCLIQUE

Anna Slobodová, Martin Mundhenk, 1997, Lectures on Proof Verification and Approximation Algorithms.

Lowness and the Complexity of Sparse and Tally Descriptions

Vikraman Arvind, Johannes Köbler, Martin Mundhenk, 1992, ISAAC.

Upper bounds for the complexity of sparse and tally descriptions

Vikraman Arvind, Johannes Köbler, Martin Mundhenk, 2005, Mathematical systems theory.

The tractability of model checking for LTL: The good, the bad, and the ugly fragments pdf

Heribert Vollmer, Henning Schnoor, Ilka Schnoor, 2008, TOCL.

SOGOS - A Distributed Meta Level Architecture for the Self-Organizing Grid of Services

Birgitta König-Ries, Christian Erfurth, Harald Sack, 2006, 7th International Conference on Mobile Data Management (MDM'06).

Competition Adds Complexity

Judy Goldsmith, Martin Mundhenk, 2007, NIPS.

Finding scientific papers with homepagesearch and MOPS

Gerd Hoff, Martin Mundhenk, 2001, SIGDOC '01.

The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I

Arne Meier, Michael Thomas, Martin Mundhenk, 2010, J. Appl. Log..

The Complexity of Satisfiability for Fragments of CTL and CTL*

Arne Meier, Heribert Vollmer, Michael Thomas, 2008, Electron. Notes Theor. Comput. Sci..

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers

Arne Meier, Michael Thomas, Stefan Göller, 2012, Advances in Modal Logic.

Bounded truth-table and conjunctive reductions to sparse and tally sets

Vikraman Arvind, Johannes Köbler, Martin Mundhenk, 2012 .

Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 5. Auflage

Christoph Meinel, Martin Mundhenk, Christoph Meinel, 2000 .

The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I

Arne Meier, Michael Thomas, Martin Mundhenk, 2009, MFCS.

Complexity of hybrid logics over transitive frames

Thomas Schwentick, Martin Mundhenk, Volker Weber, 2008, J. Appl. Log..

Hausdorff Reductions to Sparse Sets and to Sets of High Information Content

Vikraman Arvind, Johannes Köbler, Martin Mundhenk, 1993, MFCS.

Hausdorff-Reduktionen zu Mengen mit geringem Informationsgehalt

Martin Mundhenk, 1993 .

How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms

Martin Mundhenk, Robert Zeranski, 2011, SAT.

The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes

Eric Allender, Judy Goldsmith, Martin Mundhenk, 1997, MFCS.

Model checking CTL is almost always inherently sequential

Arne Meier, Heribert Vollmer, Michael Thomas, 2011 .