Martin Mundhenk

Publication Activity (10 Years)

Years Active: 1990-2019
Publications (10 Years): 6

Top Venues

CoRR

Inf. Process. Lett.

Advances in Modal Logic

Acta Informatica

University of Ulm, Germany (PHD)

Education History

University of Ulm, Germany

PHD

Publications

Andreas Krebs, Arne Meier, Martin Mundhenk
The model checking fingerprints of CTL operators. Acta Informatica 56 (6) (2019)
Andreas Krebs, Arne Meier, Martin Mundhenk
The Model Checking Fingerprints of CTL Operators. TIME (2015)
Nicholas Mattei, Judy Goldsmith, Andrew Klapper, Martin Mundhenk
On the complexity of bribery and manipulation in tournaments with uncertain information. J. Appl. Log. 13 (4) (2015)
Andreas Krebs, Arne Meier, Martin Mundhenk
The model checking fingerprints of CTL operators. CoRR (2015)
Marco Magirius, Martin Mundhenk, Raphaela Palenta
The complexity of primal logic with disjunction. Inf. Process. Lett. 115 (5) (2015)
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
. Int. J. Found. Comput. Sci. 26 (8) (2015)
Martin Mundhenk
Der Keller - ein fundamentaler Baustein der Informatik. Keller, Stack und automatisches Gedächtnis (2014)
Martin Mundhenk, Felix Weiss
An AC 1-complete model checking problem for intuitionistic logic. Comput. Complex. 23 (4) (2014)
Judy Goldsmith, Michael L. Littman, Martin Mundhenk
The Complexity of Plan Existence and Evaluation in Probabilistic Domains CoRR (2013)
Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer
Complexity of Model Checking for Logics over Kripke models. Bull. EATCS 108 (2012)
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 (2012)
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Advances in Modal Logic (2012)
Judy Goldsmith, Christopher Lusena, Martin Mundhenk
Nonapproximability Results for Partially Observable Markov Decision Processes CoRR (2011)
Martin Mundhenk, Felix Weiß
The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. STACS (2011)
Martin Mundhenk, Felix Weiss
Intuitionistic implication makes model checking hard Log. Methods Comput. Sci. 8 (2) (2011)
Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer
Model Checking CTL is Almost Always Inherently Sequential Log. Methods Comput. Sci. 7 (2) (2011)
Martin Mundhenk, Robert Zeranski
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms. SAT (2011)
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) (2011)
Martin Mundhenk, Felix Weiss
The Model Checking Problem for Propositional Intuitionistic Logic with One Variable is AC1-Complete CoRR (2010)
Martin Mundhenk, Felix Weiß
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions. RP (2010)
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
The complexity of satisfiability for fragments of hybrid logic - Part I. J. Appl. Log. 8 (4) (2010)
Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
Complexity of hybrid logics over transitive frames. J. Appl. Log. 8 (4) (2010)
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) (2009)
Martin Mundhenk, Thomas Schneider
The Complexity of Hybrid Logics over Equivalence Relations. J. Log. Lang. Inf. 18 (4) (2009)
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. Electron. Notes Theor. Comput. Sci. 231 (2009)
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I CoRR (2009)
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)
Matthias Hagen, Peter Horatschek, Martin Mundhenk
Experimental comparison of the two Fredman-Khachiyan-algorithms. ALENEX (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
Model Checking CTL is Almost Always Inherently Sequential. TIME (2009)
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 (2008)
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. Electron. Colloquium Comput. Complex. 15 (028) (2008)
Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
Complexity of Hybrid Logics over Transitive Frames CoRR (2008)
Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer
. Electron. Notes Theor. Comput. Sci. 223 (2008)
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206 (6) (2008)
Judy Goldsmith, Martin Mundhenk
Competition Adds Complexity. NIPS (2007)
Martin Mundhenk, Thomas Schneider
Undecidability of Multi-modal Hybrid Logics. Electron. Notes Theor. Comput. Sci. 174 (6) (2007)
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)
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
Complexity of DNF and Isomorphism of Monotone Formulas. MFCS (2005)
Christopher Lusena, Judy Goldsmith, Martin Mundhenk
Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. 14 (2001)
Gerd Hoff, Martin Mundhenk
Creating a virtual library with HPSearch and Mops. IuK (2001)
Gerd Hoff, Martin Mundhenk
Finding scientific papers with homepagesearch and MOPS. SIGDOC (2001)
Martin Mundhenk
The Complexity of Optimal Small Policies. Math. Oper. Res. 25 (1) (2000)
Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender
Complexity of finite-horizon Markov decision process problems. J. ACM 47 (4) (2000)
Christopher Lusena, Judy Goldsmith, Martin Mundhenk
Nonapproximability Results for Partially Observable Markov Decision Processes Universität Trier, Mathematik/Informatik, Forschungsbericht (2000)
Martin Mundhenk
On hard instances. Theor. Comput. Sci. 242 (1-2) (2000)
Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS (2000)
Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender
Complexity of Finite-Horizon Markov Decision process Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht (1999)
Martin Mundhenk
Propositional Proofs and Their Complexity Universität Trier, Mathematik/Informatik, Forschungsbericht (1999)
Gerd Hoff, Martin Mundhenk
Finding Scientific Papers with HPSearch and MOPS Universität Trier, Mathematik/Informatik, Forschungsbericht (1999)
Martin Mundhenk
The complexity of optimal small policies Universität Trier, Mathematik/Informatik, Forschungsbericht (1999)
Judy Goldsmith, Martin Mundhenk
Complexity Issues in Markov Decision Processes. Computational Complexity Conference (1998)
Michael L. Littman, Judy Goldsmith, Martin Mundhenk
The Computational Complexity of Probabilistic Planning CoRR (1998)
Michael L. Littman, Judy Goldsmith, Martin Mundhenk
The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. 9 (1998)
Martin Mundhenk
NP-Hard Sets Have Many Hard Instances. MFCS (1997)
Martin Mundhenk, Anna Slobodová
Optimal Non-approximability of MAXCLIQUE. Lectures on Proof Verification and Approximation Algorithms (1997)
Christoph Meinel, Carsten Damm, Martin Mundhenk
33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung (1997)
Judy Goldsmith, Michael L. Littman, Martin Mundhenk
The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI (1997)
Martin Mundhenk, Judy Goldsmith, Eric Allender
The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS (1997)
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
Monotonous and Randomized Reductions to Sparse Sets. RAIRO Theor. Informatics Appl. 30 (2) (1996)
Judy Goldsmith, Matthew A. Levy, Martin Mundhenk
Limited nondeterminism. SIGACT News 27 (2) (1996)
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
Upper Bounds for the Complexity of Sparse and Tally Descriptions. Math. Syst. Theory 29 (1) (1996)
Martin Mundhenk
On Monotonous Oracle Machines. LATIN (1995)
Martin Mundhenk
Monotonous Oracle Machines Universität Trier, Mathematik/Informatik, Forschungsbericht (1995)
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. 56 (2) (1995)
Martin Mundhenk
On Self-Reducible Sets of Low Information Content. CIAC (1994)
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS (1993)
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC (1992)
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)
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)
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. FSTTCS (1992)
Martin Mundhenk, Rainer Schuler
Random languages for nonuniform complexity classes. J. Complex. 7 (3) (1991)
Martin Mundhenk, Rainer Schuler
Non-Uniform Complexity Classes and Random Languages. Computational Complexity Conference (1990)

Martin Mundhenk.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Mundhenk