Michael Thomas - Citegraph

Author Info

Name	Affiliation	Papers
MICHAEL THOMAS	Theoretische Informatik, Gottfried Wilhelm Leibniz Universität, Appelstr. 4, 30167 Hannover, Germany	7
Collaborators	Citations	PageRank
14	32	3.22
Referers	Referees	References
55	145	103

Search Limit

100145

Publications (7 rows)

Collaborators (14 rows)

Referers (55 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On the parameterized complexity of non-monotonic logics	2	0.38	2015
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆.	1	0.35	2015
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	7	0.55	2011
Proof Complexity of Propositional Default Logic	5	0.43	2010
Counting classes and the fine structure between NC1and L	3	0.43	2010
The Complexity of Satisfiability for Fragments of CTL and CTL*;	14	0.74	2009

1