Author of the publication

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.

, , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 549-560. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Zentralbankpolitik in Italien. Europäische Hochschulschriften Lang, Frankfurt am Main u.a., (1998)On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic., , , and . CSL, volume 183 of LIPIcs, page 27:1-27:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Axiomatizations for Propositional and Modal Team Logic.. CSL, volume 62 of LIPIcs, page 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Complexity of Linear Temporal Logic with Team Semantics.. CoRR, (2020)Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic.. Int. J. Found. Comput. Sci., 29 (1): 17-62 (2018)On the Succinctness of Atoms of Dependency., and . CoRR, (2019)LTL Fragments are Hard for Standard Parameterisations., and . TIME, page 59-68. IEEE Computer Society, (2015)Parametrised Complexity of Satisfiability in Temporal Logic., , and . ACM Trans. Comput. Log., 18 (1): 1:1-1:32 (2017)Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem., , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 549-560. Springer, (2015)The Power of the Filtration Technique for Modal Logics with Team Semantics.. CSL, volume 82 of LIPIcs, page 31:1-31:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)