Concepedia

Martin Mundhenk

MM

Statistics

Publications

12

Citations

397

H-Index

11

Active since

1996

Affiliations

Friedrich Schiller University Jena(Current)

University of Kentucky

Leibniz University Hannover

Universität Trier

University of Manchester

Martin Mundhenk is an author at Friedrich Schiller University Jena specializing in computer science, engineering, and computational complexity.

Top concepts

Computer ScienceEngineeringComputational ComplexityFormal MethodsAutomated ReasoningVerificationFormal VerificationSatisfiabilityDecision TheoryBusiness

Publications per year

1996–2015

12

Publications

12

Complexity of finite-horizon Markov decision process problems

Martin Mundhenk, Judy Goldsmith, Christopher Lusena et al. · Journal of the ACM · 2000 · 153 citations · Full text

Mathematical Programming, Engineering, Stochastic Optimization +13

Limited nondeterminism

Judy Goldsmith, Matthew Levy, Martin Mundhenk · ACM SIGACT News · 1996 · 52 citations · Full text

Theory Of Computing, Computational Complexity Theory, Complexity Theory Column +7

THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆

Arne Meier, Michael E. Thomas, Heribert Vollmer et al. · International Journal of Foundations of Computer Science · 2009 · 33 citations

Engineering, Automated Reasoning, Satisfiability Problems +13

On the complexity of bribery and manipulation in tournaments with uncertain information

Nicholas Mattei, Judy Goldsmith, Andrew Klapper et al. · Journal of Applied Logic · 2015 · 29 citations

Uncertain Information, Computational Social Choice, Accounting +12

The tractability of model checking for LTL

Michael Bauland, Martin Mundhenk, Thomas Schneider et al. · ACM Transactions on Computational Logic · 2011 · 23 citations

Engineering, Reachability Problem, Automated Reasoning +15

1–5 of 12