default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Mundhenk
Person information
- affiliation: University of Jena, Germany
- affiliation: University of Trier, Germany
- affiliation: University of Ulm, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j24]Andreas Krebs, Arne Meier
, Martin Mundhenk:
The model checking fingerprints of CTL operators. Acta Informatica 56(6): 487-519 (2019)- 2015
- [j23]Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. Int. J. Found. Comput. Sci. 26(8): 1189- (2015) - [j22]Marco Magirius, Martin Mundhenk, Raphaela Palenta:
The complexity of primal logic with disjunction. Inf. Process. Lett. 115(5): 536-542 (2015) - [j21]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): 557-581 (2015) - [c32]Andreas Krebs, Arne Meier, Martin Mundhenk:
The Model Checking Fingerprints of CTL Operators. TIME 2015: 101-110 - [i16]Andreas Krebs, Arne Meier, Martin Mundhenk:
The model checking fingerprints of CTL operators. CoRR abs/1504.04708 (2015) - 2014
- [j20]Martin Mundhenk, Felix Weiss:
An AC 1-complete model checking problem for intuitionistic logic. Comput. Complex. 23(4): 637-669 (2014) - [c31]Martin Mundhenk:
Der Keller - ein fundamentaler Baustein der Informatik. Keller, Stack und automatisches Gedächtnis 2014: 9-18 - 2013
- [i15]Judy Goldsmith, Michael L. Littman, Martin Mundhenk:
The Complexity of Plan Existence and Evaluation in Probabilistic Domains. CoRR abs/1302.1540 (2013) - 2012
- [j19]Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer:
Complexity of Model Checking for Logics over Kripke models. Bull. EATCS 108: 49-89 (2012) - [c30]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: 261-278 - [i14]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 abs/1204.1196 (2012) - 2011
- [b5]Christoph Meinel, Martin Mundhenk:
Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 5. Auflage. Vieweg+Teubner 2011, ISBN 978-3-8348-1520-0, pp. 1-335 - [j18]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) - [j17]Martin Mundhenk, Felix Weiss:
Intuitionistic implication makes model checking hard. Log. Methods Comput. Sci. 8(2) (2011) - [j16]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): 13:1-13:28 (2011) - [c29]Martin Mundhenk, Robert Zeranski:
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms. SAT 2011: 105-119 - [c28]Martin Mundhenk, Felix Weiß:
The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. STACS 2011: 368-379 - [i13]Judy Goldsmith, Christopher Lusena, Martin Mundhenk:
Nonapproximability Results for Partially Observable Markov Decision Processes. CoRR abs/1106.0242 (2011) - 2010
- [j15]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): 409-421 (2010) - [j14]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber:
Complexity of hybrid logics over transitive frames. J. Appl. Log. 8(4): 422-440 (2010) - [c27]Martin Mundhenk, Felix Weiß:
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions. RP 2010: 146-160 - [i12]Martin Mundhenk, Felix Weiss:
The Model Checking Problem for Propositional Intuitionistic Logic with One Variable is AC1-Complete. CoRR abs/1012.3828 (2010)
2000 – 2009
- 2009
- [j13]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): 901-918 (2009) - [j12]Martin Mundhenk, Thomas Schneider:
The Complexity of Hybrid Logics over Equivalence Relations. J. Log. Lang. Inf. 18(4): 493-514 (2009) - [c26]Matthias Hagen, Peter Horatschek, Martin Mundhenk:
Experimental comparison of the two Fredman-Khachiyan-algorithms. ALENEX 2009: 154-161 - [c25]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: 587-599 - [c24]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider:
Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28 - [i11]Arne 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) - 2008
- [j11]Judy Goldsmith, Matthias Hagen, Martin Mundhenk:
Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206(6): 760-775 (2008) - [c23]Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer:
The Complexity of Satisfiability for Fragments of CTL and CTL*. RP 2008: 201-213 - [i10]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) - [i9]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber:
Complexity of Hybrid Logics over Transitive Frames. CoRR abs/0806.4130 (2008) - [i8]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. TR08 (2008) - 2007
- [c22]Judy Goldsmith, Martin Mundhenk:
Competition Adds Complexity. NIPS 2007: 561-568 - [c21]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. M4M 2007: 277-292 - 2006
- [b4]Christoph Meinel, Martin Mundhenk:
Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 3. Auflage. Teubner 2006, ISBN 978-3-8351-0049-7, pp. 1-333 - [c20]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 - [c19]Martin Mundhenk, Thomas Schneider:
Undecidability of Multi-modal Hybrid Logics. HyLo@FLoC 2006: 29-43 - 2005
- [c18]Judy Goldsmith, Matthias Hagen, Martin Mundhenk:
Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421 - 2002
- [b3]Christoph Meinel, Martin Mundhenk:
Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung, 2. Auflage. Teubner 2002, ISBN 3-519-12949-3 - 2001
- [j10]Christopher Lusena, Judy Goldsmith, Martin Mundhenk:
Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. 14: 83-103 (2001) - [c17]Gerd Hoff, Martin Mundhenk:
Creating a virtual library with HPSearch and Mops. IuK 2001 - [c16]Gerd Hoff, Martin Mundhenk:
Finding scientific papers with homepagesearch and MOPS. SIGDOC 2001: 201-207 - 2000
- [b2]Christoph Meinel, Martin Mundhenk:
Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung. Teubner 2000, ISBN 3-519-02949-9 - [j9]Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender:
Complexity of finite-horizon Markov decision process problems. J. ACM 47(4): 681-720 (2000) - [j8]Martin Mundhenk:
The Complexity of Optimal Small Policies. Math. Oper. Res. 25(1): 118-129 (2000) - [j7]Martin Mundhenk:
On hard instances. Theor. Comput. Sci. 242(1-2): 301-311 (2000) - [c15]Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán:
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323 - [i7]Christopher Lusena, Judy Goldsmith, Martin Mundhenk:
Nonapproximability Results for Partially Observable Markov Decision Processes. Universität Trier, Mathematik/Informatik, Forschungsbericht 00-12 (2000)
1990 – 1999
- 1999
- [i6]Martin Mundhenk:
Propositional Proofs and Their Complexity. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-21 (1999) - [i5]Martin Mundhenk:
The complexity of optimal small policies. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-22 (1999) - [i4]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) - [i3]Gerd Hoff, Martin Mundhenk:
Finding Scientific Papers with HPSearch and MOPS. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-26 (1999) - 1998
- [j6]Michael L. Littman, Judy Goldsmith, Martin Mundhenk:
The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. 9: 1-36 (1998) - [c14]Judy Goldsmith, Martin Mundhenk:
Complexity Issues in Markov Decision Processes. CCC 1998: 272-280 - [i2]Michael L. Littman, Judy Goldsmith, Martin Mundhenk:
The Computational Complexity of Probabilistic Planning. CoRR cs.AI/9808101 (1998) - 1997
- [c13]Martin Mundhenk, Anna Slobodová:
Optimal Non-approximability of MAXCLIQUE. Lectures on Proof Verification and Approximation Algorithms 1997: 235-248 - [c12]Christoph Meinel, Carsten Damm, Martin Mundhenk:
33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen". GI Jahrestagung 1997: 624-625 - [c11]Martin Mundhenk, Judy Goldsmith, Eric Allender:
The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997: 129-138 - [c10]Martin Mundhenk:
NP-Hard Sets Have Many Hard Instances. MFCS 1997: 428-437 - [c9]Judy Goldsmith, Michael L. Littman, Martin Mundhenk:
The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI 1997: 182-189 - 1996
- [j5]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Monotonous and Randomized Reductions to Sparse Sets. RAIRO Theor. Informatics Appl. 30(2): 155-179 (1996) - [j4]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Upper Bounds for the Complexity of Sparse and Tally Descriptions. Math. Syst. Theory 29(1): 63-94 (1996) - [j3]Judy Goldsmith, Matthew A. Levy, Martin Mundhenk:
Limited nondeterminism. SIGACT News 27(2): 20-29 (1996) - 1995
- [j2]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. 56(2): 109-114 (1995) - [c8]Martin Mundhenk:
On Monotonous Oracle Machines. LATIN 1995: 436-448 - [i1]Martin Mundhenk:
Monotonous Oracle Machines. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-02 (1995) - 1994
- [c7]Martin Mundhenk:
On Self-Reducible Sets of Low Information Content. CIAC 1994: 203-212 - 1993
- [b1]Martin Mundhenk:
Hausdorff-Reduktionen zu Mengen mit geringem Informationsgehalt. University of Ulm, Germany, 1993, pp. 1-87 - [c6]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS 1993: 232-241 - 1992
- [c5]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 - [c4]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. FSTTCS 1992: 140-151 - [c3]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 - [c2]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC 1992: 249-258 - 1991
- [j1]Martin Mundhenk, Rainer Schuler:
Random languages for nonuniform complexity classes. J. Complex. 7(3): 296-310 (1991) - 1990
- [c1]Martin Mundhenk, Rainer Schuler:
Non-Uniform Complexity Classes and Random Languages. SCT 1990: 110-119
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
