Martin Lück

Publication Activity (10 Years)

Years Active: 2014-2021
Publications (10 Years): 23

Top Venues

CoRR

CSL

Log. Methods Comput. Sci.

ACM Trans. Comput. Log.

University of Hanover, Hannover, Germany (PHD)

Education History

University of Hanover, Hannover, Germany

PHD

Publications

Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CSL (2021)
Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CoRR (2020)
Martin Lück
On the Complexity of Linear Temporal Logic with Team Semantics. CoRR (2020)
Martin Lück
On the complexity of linear temporal logic with team semantics. Theor. Comput. Sci. 837 (2020)
Martin Lück, Miikka Vilander
On the Succinctness of Atoms of Dependency. Log. Methods Comput. Sci. 15 (3) (2019)
Martin Lück
Canonical Models and the Complexity of Modal Team Logic. Log. Methods Comput. Sci. 15 (2) (2019)
Martin Lück, Miikka Vilander
On the Succinctness of Atoms of Dependency. CoRR (2019)
Martin Lück
On the Complexity of Team Logic and its Two-Variable Fragment. CoRR (2018)
Martin Lück
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. Int. J. Found. Comput. Sci. 29 (1) (2018)
Martin Lück
Axiomatizations of team logics. Ann. Pure Appl. Log. 169 (9) (2018)
Martin Lück
Canonical Models and the Complexity of Modal Team Logic. CSL (2018)
Martin Lück
On the Complexity of Team Logic and Its Two-Variable Fragment. MFCS (2018)
Martin Lück
On the Complexity of Modal Team Logic and Two-Variable Team Logic. CoRR (2017)
Martin Lück
The Power of the Filtration Technique for Modal Logics with Team Semantics. CSL (2017)
Martin Lück, Arne Meier, Irena Schindler
Parametrised Complexity of Satisfiability in Temporal Logic. ACM Trans. Comput. Log. 18 (1) (2017)
Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema
On Quantified Propositional Logics and the Exponential Time Hierarchy. GandALF (2016)
Martin Lück
Axiomatizations for Propositional and Modal Team Logic. CSL (2016)
Martin Lück
Axiomatizations of Team Logics. CoRR (2016)
Martin Lück
Complete Problems of Propositional Logic for the Exponential Hierarchy. CoRR (2016)
Martin Lück, Arne Meier, Irina Schindler
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. LATA (2015)
Martin Lück, Arne Meier
LTL Fragments are Hard for Standard Parameterisations. CoRR (2015)
Martin Lück, Arne Meier
LTL Fragments are Hard for Standard Parameterisations. TIME (2015)
Martin Lück
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. CoRR (2015)
Martin Lück, Arne Meier, Irina Schindler
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem. CoRR (2014)
Martin Lück, Arne Meier, Irina Schindler
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. Electron. Colloquium Comput. Complex. 21 (2014)

Martin Lück.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Lück