Neural Networks and Optimization Algorithms Applied for Construction of Low Noise Tread Profiles. - Matthias Becker 002; Helena Szczerbicka; Michael Thomas 001 (Cybern. Syst., 2007)

The Complexity of Satisfiability for Fragments of CTL and CTL*. - Arne Meier; Martin Mundhenk; Michael Thomas 001; Heribert Vollmer (RP, 2008)

The Complexity of Satisfiability for Fragments of CTL and CTL*. - Arne Meier; Michael Thomas 001; Heribert Vollmer; Martin Mundhenk (Int. J. Found. Comput. Sci., 2009)

The complexity of propositional implication. - Olaf Beyersdorff; Arne Meier; Michael Thomas 001; Heribert Vollmer (Inf. Process. Lett., 2009)

Sets of Boolean Connectives That Make Argumentation Easier. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001; Stefan Woltran (JELIA, 2010)

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001 (KR, 2010)

Complexity of non-monotonic logics. - Michael Thomas 001; Heribert Vollmer (Bull. EATCS, 2010)

The complexity of satisfiability for fragments of hybrid logic - Part I. - Arne Meier; Martin Mundhenk; Thomas Schneider 002; Michael Thomas 001; Volker Weber; Felix Weiss (J. Appl. Log., 2010)

Extensional Uniformity for Boolean Circuits. - Pierre McKenzie; Michael Thomas 001; Heribert Vollmer (SIAM J. Comput., 2010)

On the complexity of fragments of nonmonotonic logics. - Michael Thomas 001 (2010)

Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (MFCS, 2011)

Proof complexity of propositional default logic. - Olaf Beyersdorff; Arne Meier; Sebastian Müller 003; Michael Thomas 001; Heribert Vollmer (Arch. Math. Log., 2011)

Complexity of logic-based argumentation in Post's framework. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001; Stefan Woltran (Argument Comput., 2011)

Model Checking CTL is Almost Always Inherently Sequential - Olaf Beyersdorff; Arne Meier; Martin Mundhenk; Thomas Schneider 002; Michael Thomas 001; Heribert Vollmer (Log. Methods Comput. Sci., 2011)

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. - Stefan Göller; Arne Meier; Martin Mundhenk; Thomas Schneider 002; Michael Thomas 001; Felix Weiß (Advances in Modal Logic, 2012)

On the Parameterized Complexity of Default Logic and Autoepistemic Logic. - Arne Meier; Johannes Schmidt 001; Michael Thomas 001; Heribert Vollmer (LATA, 2012)

Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Andreas Krebs; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (Electron. Colloquium Comput. Complex., 2012)

On the applicability of Post's lattice. - Michael Thomas 001 (Inf. Process. Lett., 2012)

The complexity of reasoning for fragments of default logic. - Olaf Beyersdorff; Arne Meier; Michael Thomas 001; Heribert Vollmer (J. Log. Comput., 2012)

Complexity Classifications for Propositional Abduction in Post's Framework. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001 (J. Log. Comput., 2012)

The Complexity of Circumscriptive Inference in Post's Lattice. - Michael Thomas 001 (Theory Comput. Syst., 2012)

Counting classes and the fine structure between NC1 and L. - Samir Datta; Meena Mahajan; B. V. Raghavendra Rao; Michael Thomas 001; Heribert Vollmer (Theor. Comput. Sci., 2012)

The Complexity of Reasoning for Fragments of Autoepistemic Logic. - Nadia Creignou; Arne Meier; Heribert Vollmer; Michael Thomas 001 (ACM Trans. Comput. Log., 2012)

On the parameterized complexity of non-monotonic logics. - Arne Meier; Irina Schindler; Johannes Schmidt 001; Michael Thomas 001; Heribert Vollmer (Arch. Math. Log., 2015)

Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. - Arne Meier; Michael Thomas 001; Heribert Vollmer; Martin Mundhenk (Int. J. Found. Comput. Sci., 2015)