Martin Mundhenk

77 papers A* 1A 6B 9C 3Journal 40Unranked 13

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	The model checking fingerprints of CTL operators. Acta Informatica Andreas Krebs, Arne Meier, Martin Mundhenk
2015	J	`jnl`	Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL Int. J. Found. Comput. Sci. Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
2015	J	`jnl`	On the complexity of bribery and manipulation in tournaments with uncertain information. J. Appl. Log. Nicholas Mattei, Judy Goldsmith, Andrew Klapper, Martin Mundhenk
2015	C	`conf`	The Model Checking Fingerprints of CTL Operators. TIME Andreas Krebs, Arne Meier, Martin Mundhenk
2015	J	`jnl`	The complexity of primal logic with disjunction. Inf. Process. Lett. Marco Magirius, Martin Mundhenk, Raphaela Palenta
2015	J	`jnl`	The model checking fingerprints of CTL operators. CoRR Andreas Krebs, Arne Meier, Martin Mundhenk
2014	J	`jnl`	An AC 1-complete model checking problem for intuitionistic logic. Comput. Complex. Martin Mundhenk, Felix Weiss
2014	—	`conf`	Der Keller - ein fundamentaler Baustein der Informatik. Keller, Stack und automatisches Gedächtnis Martin Mundhenk
2013	J	`jnl`	The Complexity of Plan Existence and Evaluation in Probabilistic Domains CoRR Judy Goldsmith, Michael L. Littman, Martin Mundhenk
2012	J	`jnl`	Complexity of Model Checking for Logics over Kripke models. Bull. EATCS Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer
2012	J	`jnl`	The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers CoRR Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss
2012	B	`conf`	The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Advances in Modal Logic Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß
2011	A	`conf`	How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms. SAT Martin Mundhenk, Robert Zeranski
2011	J	`jnl`	Intuitionistic implication makes model checking hard Log. Methods Comput. Sci. Martin Mundhenk, Felix Weiss
2011	—	`book`	Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 5. Auflage. Christoph Meinel, Martin Mundhenk
2011	J	`jnl`	Model Checking CTL is Almost Always Inherently Sequential Log. Methods Comput. Sci. Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer
2011	J	`jnl`	Nonapproximability Results for Partially Observable Markov Decision Processes CoRR Judy Goldsmith, Christopher Lusena, Martin Mundhenk
2011	A	`conf`	The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. STACS Martin Mundhenk, Felix Weiß
2011	J	`jnl`	The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2010	J	`jnl`	Complexity of hybrid logics over transitive frames. J. Appl. Log. Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
2010	—	`conf`	The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions. RP Martin Mundhenk, Felix Weiß
2010	J	`jnl`	The Model Checking Problem for Propositional Intuitionistic Logic with One Variable is AC1-Complete CoRR Martin Mundhenk, Felix Weiss
2010	J	`jnl`	The complexity of satisfiability for fragments of hybrid logic - Part I. J. Appl. Log. Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009	A	`conf`	Experimental comparison of the two Fredman-Khachiyan-algorithms. ALENEX Matthias Hagen, Peter Horatschek, Martin Mundhenk
2009	C	`conf`	Model Checking CTL is Almost Always Inherently Sequential. TIME Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
2009	J	`jnl`	The Complexity of Hybrid Logics over Equivalence Relations. J. Log. Lang. Inf. Martin Mundhenk, Thomas Schneider
2009	J	`jnl`	The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
2009	J	`jnl`	The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I CoRR Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009	B	`conf`	The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. MFCS Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2008	J	`jnl`	Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. Judy Goldsmith, Matthias Hagen, Martin Mundhenk
2008	J	`jnl`	Complexity of Hybrid Logics over Transitive Frames CoRR Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
2008	—	`conf`	The Complexity of Satisfiability for Fragments of CTL and CTL RP Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer
2008	J	`jnl`	The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments CoRR Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2008	J	`jnl`	The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electron. Colloquium Comput. Complex. Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2007	—	`conf`	Competition Adds Complexity. NIPS Judy Goldsmith, Martin Mundhenk
2007	—	`conf`	The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. M4M Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2006	—	`book`	Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 3. Auflage. Christoph Meinel, Martin Mundhenk
2006	B	`conf`	SOGOS - A Distributed Meta Level Architecture for the Self-Organizing Grid of Services. MDM Clemens Beckstein, Peter Dittrich, Christian Erfurth, Dietmar Fey, Birgitta König-Ries, Martin Mundhenk, Harald Sack
2006	—	`conf`	Undecidability of Multi-modal Hybrid Logics. HyLo@FLoC Martin Mundhenk, Thomas Schneider
2005	B	`conf`	Complexity of DNF and Isomorphism of Monotone Formulas. MFCS Judy Goldsmith, Matthias Hagen, Martin Mundhenk
2002	—	`book`	Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung, 2. Auflage Christoph Meinel, Martin Mundhenk
2001	—	`conf`	Creating a virtual library with HPSearch and Mops. IuK Gerd Hoff, Martin Mundhenk
2001	—	`conf`	Finding scientific papers with homepagesearch and MOPS. SIGDOC Gerd Hoff, Martin Mundhenk
2001	J	`jnl`	Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. Christopher Lusena, Judy Goldsmith, Martin Mundhenk
2000	J	`jnl`	Complexity of finite-horizon Markov decision process problems. J. ACM Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender
2000	—	`book`	Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung Christoph Meinel, Martin Mundhenk
2000	J	`jnl`	Nonapproximability Results for Partially Observable Markov Decision Processes Universität Trier, Mathematik/Informatik, Forschungsbericht Christopher Lusena, Judy Goldsmith, Martin Mundhenk
2000	A	`conf`	Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
2000	J	`jnl`	On hard instances. Theor. Comput. Sci. Martin Mundhenk
2000	J	`jnl`	The Complexity of Optimal Small Policies. Math. Oper. Res. Martin Mundhenk
1999	J	`jnl`	Complexity of Finite-Horizon Markov Decision process Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender
1999	J	`jnl`	Finding Scientific Papers with HPSearch and MOPS Universität Trier, Mathematik/Informatik, Forschungsbericht Gerd Hoff, Martin Mundhenk
1999	J	`jnl`	Propositional Proofs and Their Complexity Universität Trier, Mathematik/Informatik, Forschungsbericht Martin Mundhenk
1999	J	`jnl`	The complexity of optimal small policies Universität Trier, Mathematik/Informatik, Forschungsbericht Martin Mundhenk
1998	A	`conf`	Complexity Issues in Markov Decision Processes. CCC Judy Goldsmith, Martin Mundhenk
1998	J	`jnl`	The Computational Complexity of Probabilistic Planning CoRR Michael L. Littman, Judy Goldsmith, Martin Mundhenk
1998	J	`jnl`	The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. Michael L. Littman, Judy Goldsmith, Martin Mundhenk
1997	—	`conf`	33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung Christoph Meinel, Carsten Damm, Martin Mundhenk
1997	B	`conf`	NP-Hard Sets Have Many Hard Instances. MFCS Martin Mundhenk
1997	—	`conf`	Optimal Non-approximability of MAXCLIQUE. Lectures on Proof Verification and Approximation Algorithms Martin Mundhenk, Anna Slobodová
1997	A	`conf`	The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI Judy Goldsmith, Michael L. Littman, Martin Mundhenk
1997	B	`conf`	The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS Martin Mundhenk, Judy Goldsmith, Eric Allender
1996	J	`jnl`	Limited nondeterminism. SIGACT News Judy Goldsmith, Matthew A. Levy, Martin Mundhenk
1996	J	`jnl`	Monotonous and Randomized Reductions to Sparse Sets. RAIRO Theor. Informatics Appl. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1996	J	`jnl`	Upper Bounds for the Complexity of Sparse and Tally Descriptions. Math. Syst. Theory Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1995	J	`jnl`	Monotonous Oracle Machines Universität Trier, Mathematik/Informatik, Forschungsbericht Martin Mundhenk
1995	B	`conf`	On Monotonous Oracle Machines. LATIN Martin Mundhenk
1995	J	`jnl`	On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1994	C	`conf`	On Self-Reducible Sets of Low Information Content. CIAC Martin Mundhenk
1993	B	`conf`	Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1993	—	`—`	Hausdorff-Reduktionen zu Mengen mit geringem Informationsgehalt. Martin Mundhenk
1992	B	`conf`	Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1992	—	`conf`	On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. FSTTCS Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1992	—	`conf`	Reductions to Sets of Low Information Content. Complexity Theory: Current Research Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1992	A*	`conf`	Reductions to Sets of Low Information Content. ICALP Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1991	J	`jnl`	Random languages for nonuniform complexity classes. J. Complex. Martin Mundhenk, Rainer Schuler
1990	—	`conf`	Non-Uniform Complexity Classes and Random Languages. SCT Martin Mundhenk, Rainer Schuler