Michael Bauland

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The tractability of model checking for LTL: the good, the bad, and the ugly fragments ACM Transactions on Computational Logic	2015-09-17	Paper
The tractability of model-checking for LTL: the good, the bad, and the ugly fragments Electronic Notes in Theoretical Computer Science	2015-03-23	Paper
The complexity of problems for quantified constraints Theory of Computing Systems	2010-10-06	Paper
Isomorphic implication Theory of Computing Systems	2009-08-06	Paper
The complexity of satisfiability problems: Refining Schaefer's theorem Journal of Computer and System Sciences	2009-04-30	Paper
The Complexity of Generalized Satisfiability for Linear Temporal Logic Logical Methods in Computer Science	2009-04-29	Paper
Generalized Modal Satisfiability STACS 2006	2008-03-19	Paper
The Complexity of Generalized Satisfiability for Linear Temporal Logic Foundations of Software Science and Computational Structures	2007-09-07	Paper
Mathematical Foundations of Computer Science 2005 Lecture Notes in Computer Science	2006-10-20	Paper
Mathematical Foundations of Computer Science 2005 Lecture Notes in Computer Science	2006-10-20	Paper
Theory and Applications of Satisfiability Testing Lecture Notes in Computer Science	2005-12-16	Paper

Research outcomes over time

This page was built for person: Michael Bauland