The SCEAS System
| |||||||

## Search the dblp DataBase
Martin Mundhenk:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Martin Mundhenk
**On Self-Reducible Sets of Low Information Content.**[Citation Graph (0, 0)][DBLP] CIAC, 1994, pp:203-212 [Conf] - Judy Goldsmith, Martin Mundhenk
**Complexity Issues in Markov Decision Processes.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1998, pp:272-280 [Conf] - Martin Mundhenk, Rainer Schuler
**Non-Uniform Complexity Classes and Random Languages.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:110-119 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Complexity Theory: Current Research, 1992, pp:1-46 [Conf] - Martin Mundhenk, Anna Slobodová
**Optimal Non-approximability of MAXCLIQUE.**[Citation Graph (0, 0)][DBLP] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:235-248 [Conf] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1992, pp:140-151 [Conf] - Christoph Meinel, Carsten Damm, Martin Mundhenk
**33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen".**[Citation Graph (0, 0)][DBLP] GI Jahrestagung, 1997, pp:624-625 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ICALP, 1992, pp:162-173 [Conf] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**Lowness and the Complexity of Sparse and Tally Descriptions.**[Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:249-258 [Conf] - Gerd Hoff, Martin Mundhenk
**Creating a virtual library with HPSearch and Mops.**[Citation Graph (0, 0)][DBLP] IuK, 2001, pp:- [Conf] - Martin Mundhenk
**On Monotonous Oracle Machines.**[Citation Graph (0, 0)][DBLP] LATIN, 1995, pp:436-448 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] MDM, 2006, pp:82- [Conf] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**Hausdorff Reductions to Sparse Sets and to Sets of High Information Content.**[Citation Graph (0, 0)][DBLP] MFCS, 1993, pp:232-241 [Conf] - Judy Goldsmith, Matthias Hagen, Martin Mundhenk
**Complexity of DNF and Isomorphism of Monotone Formulas.**[Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:410-421 [Conf] - Martin Mundhenk
**NP-Hard Sets Have Many Hard Instances.**[Citation Graph (0, 0)][DBLP] MFCS, 1997, pp:428-437 [Conf] - Martin Mundhenk, Judy Goldsmith, Eric Allender
**The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes.**[Citation Graph (0, 0)][DBLP] MFCS, 1997, pp:129-138 [Conf] - Gerd Hoff, Martin Mundhenk
**Finding scientific papers with homepagesearch and MOPS.**[Citation Graph (0, 0)][DBLP] SIGDOC, 2001, pp:201-207 [Conf] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
**Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.**[Citation Graph (0, 0)][DBLP] STACS, 2000, pp:314-323 [Conf] - Judy Goldsmith, Michael L. Littman, Martin Mundhenk
**The Complexity of Plan Existence and Evaluation in Probabilistic Domains.**[Citation Graph (0, 0)][DBLP] UAI, 1997, pp:182-189 [Conf] - Michael L. Littman, Judy Goldsmith, Martin Mundhenk
**The Computational Complexity of Probabilistic Planning**[Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal] - Martin Mundhenk, Thomas Schneider
**Undecidability of Multi-modal Hybrid Logics.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:174, n:6, pp:29-43 [Journal] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**On Reductions to Sets that Avoid EXPSPACE.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:56, n:2, pp:109-114 [Journal] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**Monotonous and Randomized Reductions to Sparse Sets.**[Citation Graph (0, 0)][DBLP] ITA, 1996, v:30, n:2, pp:155-179 [Journal] - Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender
**Complexity of finite-horizon Markov decision process problems.**[Citation Graph (0, 0)][DBLP] J. ACM, 2000, v:47, n:4, pp:681-720 [Journal] - Michael L. Littman, Judy Goldsmith, Martin Mundhenk
**The Computational Complexity of Probabilistic Planning.**[Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 1998, v:9, n:, pp:1-36 [Journal] - Christopher Lusena, Judy Goldsmith, Martin Mundhenk
**Nonapproximability Results for Partially Observable Markov Decision Processes.**[Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2001, v:14, n:, pp:83-103 [Journal] - Martin Mundhenk, Rainer Schuler
**Random languages for nonuniform complexity classes.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1991, v:7, n:3, pp:296-310 [Journal] - Martin Mundhenk
**The Complexity of Optimal Small Policies.**[Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2000, v:25, n:1, pp:118-129 [Journal] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**Upper Bounds for the Complexity of Sparse and Tally Descriptions.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1996, v:29, n:1, pp:63-94 [Journal] - Martin Mundhenk
**On hard instances.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:242, n:1-2, pp:301-311 [Journal] **Experimental comparison of the two Fredman-Khachiyan-algorithms.**[Citation Graph (, )][DBLP]**The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.**[Citation Graph (, )][DBLP]**Competition Adds Complexity.**[Citation Graph (, )][DBLP]**Model Checking CTL is Almost Always Inherently Sequential.**[Citation Graph (, )][DBLP]**The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions.**[Citation Graph (, )][DBLP]**The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments**[Citation Graph (, )][DBLP]**Complexity of Hybrid Logics over Transitive Frames**[Citation Graph (, )][DBLP]**The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I**[Citation Graph (, )][DBLP]**The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments.**[Citation Graph (, )][DBLP]**The Complexity of Satisfiability for Fragments of CTL and CTL**[Citation Graph (, )][DBLP]^{*}.**The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.009secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |