Martin Mundhenk

According to our database1, Martin Mundhenk authored at least 67 papers between 1990 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2015
On the complexity of bribery and manipulation in tournaments with uncertain information.
J. Applied Logic, 2015

The complexity of primal logic with disjunction.
Inf. Process. Lett., 2015

Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL.
Int. J. Found. Comput. Sci., 2015

The Model Checking Fingerprints of CTL Operators.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

2014
An AC 1-complete model checking problem for intuitionistic logic.
Computational Complexity, 2014

Der Keller - ein fundamentaler Baustein der Informatik.
Proceedings of the Keller, Stack und automatisches Gedächtnis, 2014

2012
Complexity of Model Checking for Logics over Kripke models.
Bulletin of the EATCS, 2012

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.
Proceedings of the Advances in Modal Logic 9, 2012

2011
The tractability of model checking for LTL: The good, the bad, and the ugly fragments.
ACM Trans. Comput. Log., 2011

Intuitionistic implication makes model checking hard
Logical Methods in Computer Science, 2011

Model Checking CTL is Almost Always Inherently Sequential
Logical Methods in Computer Science, 2011

The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 5. Auflage.
Vieweg+Teubner, ISBN: 978-3-8348-1520-0, 2011

2010
Complexity of hybrid logics over transitive frames.
J. Applied Logic, 2010

The complexity of satisfiability for fragments of hybrid logic - Part I.
J. Applied Logic, 2010

The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

2009
The Complexity of Hybrid Logics over Equivalence Relations.
Journal of Logic, Language and Information, 2009

The Complexity of Satisfiability for Fragments of CTL and CTL*.
Int. J. Found. Comput. Sci., 2009

The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments.
Electr. Notes Theor. Comput. Sci., 2009

Model Checking CTL is Almost Always Inherently Sequential.
Proceedings of the TIME 2009, 2009

The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Experimental comparison of the two Fredman-Khachiyan-algorithms.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
Complexity of DNF minimization and isomorphism testing for monotone formulas.
Inf. Comput., 2008

The Complexity of Satisfiability for Fragments of CTL and CTL*.
Electr. Notes Theor. Comput. Sci., 2008

The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments.
Electronic Colloquium on Computational Complexity (ECCC), 2008

2007
Undecidability of Multi-modal Hybrid Logics.
Electr. Notes Theor. Comput. Sci., 2007

Competition Adds Complexity.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006
SOGOS - A Distributed Meta Level Architecture for the Self-Organizing Grid of Services.
Proceedings of the 7th International Conference on Mobile Data Management (MDM 2006), 2006

Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen: eine Einführung, 3. Auflage.
Teubner, ISBN: 978-3-8351-0049-7, 2006

2005
Complexity of DNF and Isomorphism of Monotone Formulas.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2002
Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung, 2. Auflage
Teubner, ISBN: 3-519-12949-3, 2002

2001
Nonapproximability Results for Partially Observable Markov Decision Processes.
J. Artif. Intell. Res., 2001

Finding scientific papers with homepagesearch and MOPS.
Proceedings of the Nineteenth Annual International Conference of Computer Documentation: Communicating in the New Millennium, 2001

Creating a virtual library with HPSearch and Mops.
IuK, 2001

2000
Nonapproximability Results for Partially Observable Markov Decision Processes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2000

On hard instances.
Theor. Comput. Sci., 2000

The Complexity of Optimal Small Policies.
Math. Oper. Res., 2000

Complexity of finite-horizon Markov decision process problems.
J. ACM, 2000

Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.
Proceedings of the STACS 2000, 2000

Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung
Teubner, ISBN: 3-519-02949-9, 2000

1999
Finding Scientific Papers with HPSearch and MOPS
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

Complexity of Finite-Horizon Markov Decision process Problems.
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

The complexity of optimal small policies
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

Propositional Proofs and Their Complexity
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

1998
The Computational Complexity of Probabilistic Planning.
J. Artif. Intell. Res., 1998

Complexity Issues in Markov Decision Processes.
Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997
The Complexity of Plan Existence and Evaluation in Probabilistic Domains.
Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

NP-Hard Sets Have Many Hard Instances.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

33. Workshop "Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen".
Proceedings of the Informatik '97, 1997

Optimal Non-approximability of MAXCLIQUE.
Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

1996
Limited nondeterminism.
SIGACT News, 1996

Upper Bounds for the Complexity of Sparse and Tally Descriptions.
Mathematical Systems Theory, 1996

Monotonous and Randomized Reductions to Sparse Sets.
ITA, 1996

1995
Monotonous Oracle Machines
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

On Reductions to Sets that Avoid EXPSPACE.
Inf. Process. Lett., 1995

On Monotonous Oracle Machines.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994
On Self-Reducible Sets of Low Information Content.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Hausdorff-Reduktionen zu Mengen mit geringem Informationsgehalt.
PhD thesis, 1993

1992
Lowness and the Complexity of Sparse and Tally Descriptions.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Reductions to Sets of Low Information Content.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

Reductions to Sets of Low Information Content.
Proceedings of the Complexity Theory: Current Research, 1992

1991
Random languages for nonuniform complexity classes.
J. Complexity, 1991

1990
Non-Uniform Complexity Classes and Random Languages.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990


  Loading...