Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Kagami, O.
Daniel P. Kennedy
Barbara Aquilani
Joseph Massaro
Andy Bytheway
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Home
/
Author
/
MARTIN MUNDHENK
Author Info
Open Visualization
Name
Affiliation
Papers
MARTIN MUNDHENK
Institut für Informatik, Friedrich-Schiller-Universität, 07737 Jena, Germany
7
Collaborators
Citations
PageRank
11
23
2.95
Referers
Referees
References
37
80
67
Publications (7 rows)
Collaborators (11 rows)
Referers (37 rows)
Referees (80 rows)
Title
Citations
PageRank
Year
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆.
1
0.35
2015
The model checking fingerprints of CTL operators.
0
0.34
2015
An AC 1-complete model checking problem for intuitionistic logic
0
0.34
2014
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
0
0.34
2012
Model Checking CTL is Almost Always Inherently Sequential
2
0.37
2011
The Complexity of Satisfiability for Fragments of CTL and CTL*;
14
0.74
2009
Undecidability of Multi-modal Hybrid Logics
6
0.47
2007
1