Michael Bauland

According to our database1, Michael Bauland authored at least 9 papers between 2004 and 2009.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
Isomorphic Implication.
Theory Comput. Syst., 2009

The complexity of satisfiability problems: Refining Schaefer's theorem.
J. Comput. Syst. Sci., 2009

2008
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments.
Electron. Colloquium Comput. Complex., 2008

2007
Complexity results for boolean constraint satisfaction problems.
PhD thesis, 2007

The Complexity of Problems for Quantified Constraints.
Electron. Colloquium Comput. Complex., 2007

2006
The Complexity of Generalized Satisfiability for Linear Temporal Logic.
Electron. Colloquium Comput. Complex., 2006

Generalized Modal Satisfiability.
Proceedings of the STACS 2006, 2006

2005
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
Electron. Colloquium Comput. Complex., 2005

2004
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004


  Loading...