default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Lück
Person information
- affiliation: Leibniz Universität Hannover, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2020
[b1]Martin Lück:
Team logic: axioms, expressiveness, complexity. University of Hanover, Hannover, Germany, 2020
Journal Articles
- 2020
- [j6]Martin Lück:
On the complexity of linear temporal logic with team semantics. Theor. Comput. Sci. 837: 1-25 (2020) - 2019
- [j5]Martin Lück:
Canonical Models and the Complexity of Modal Team Logic. Log. Methods Comput. Sci. 15(2) (2019) - [j4]Martin Lück, Miikka Vilander:
On the Succinctness of Atoms of Dependency. Log. Methods Comput. Sci. 15(3) (2019) - 2018
- [j3]Martin Lück:
Axiomatizations of team logics. Ann. Pure Appl. Log. 169(9): 928-969 (2018) - [j2]Martin Lück:
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. Int. J. Found. Comput. Sci. 29(1): 17-62 (2018) - 2017
- [j1]Martin Lück, Arne Meier
, Irena Schindler:
Parametrised Complexity of Satisfiability in Temporal Logic. ACM Trans. Comput. Log. 18(1): 1:1-1:32 (2017)
Conference and Workshop Papers
- 2021
- [c8]Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CSL 2021: 27:1-27:22 - 2018
- [c7]Martin Lück:
Canonical Models and the Complexity of Modal Team Logic. CSL 2018: 30:1-30:23 - [c6]Martin Lück:
On the Complexity of Team Logic and Its Two-Variable Fragment. MFCS 2018: 27:1-27:22 - 2017
- [c5]Martin Lück:
The Power of the Filtration Technique for Modal Logics with Team Semantics. CSL 2017: 31:1-31:20 - 2016
- [c4]Martin Lück:
Axiomatizations for Propositional and Modal Team Logic. CSL 2016: 33:1-33:18 - [c3]Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On Quantified Propositional Logics and the Exponential Time Hierarchy. GandALF 2016: 198-212 - 2015
- [c2]Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. LATA 2015: 549-560 - [c1]Martin Lück, Arne Meier:
LTL Fragments are Hard for Standard Parameterisations. TIME 2015: 59-68
Informal and Other Publications
- 2020
- [i11]Martin Lück:
On the Complexity of Linear Temporal Logic with Team Semantics. CoRR abs/2004.12682 (2020) - [i10]Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CoRR abs/2007.03867 (2020) - 2019
- [i9]Martin Lück, Miikka Vilander:
On the Succinctness of Atoms of Dependency. CoRR abs/1903.02344 (2019) - 2018
- [i8]Martin Lück:
On the Complexity of Team Logic and its Two-Variable Fragment. CoRR abs/1804.04968 (2018) - 2017
- [i7]Martin Lück:
On the Complexity of Modal Team Logic and Two-Variable Team Logic. CoRR abs/1709.05253 (2017) - 2016
- [i6]Martin Lück:
Complete Problems of Propositional Logic for the Exponential Hierarchy. CoRR abs/1602.03050 (2016) - [i5]Martin Lück:
Axiomatizations of Team Logics. CoRR abs/1602.05040 (2016) - 2015
- [i4]Martin Lück, Arne Meier:
LTL Fragments are Hard for Standard Parameterisations. CoRR abs/1504.06187 (2015) - [i3]Martin Lück:
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. CoRR abs/1510.08786 (2015) - 2014
- [i2]Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem. CoRR abs/1410.4044 (2014) - [i1]Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. Electron. Colloquium Comput. Complex. TR14 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
