Logo Leibniz Universität Hannover
Logo: Theoretical Computer Science
Logo Leibniz Universität Hannover
Logo: Theoretical Computer Science
  • Zielgruppen
  • Suche
 

Contact

E-Mail:thomas
PGP:19A82B22 (formerly A35E6BAC)
X.509:F9731CBE

Publications

search
in all authortitledescription
category
year
 

2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1990 all years

Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer (2015): On the parameterized complexity of non-monotonic logics , Archive for Mathematical Logic, Springer Science + Business Media
DOI: 10.1007/s00153-015-0435-x

Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer (2012): On the Parameterized Complexity of Default Logic and Autoepistemic Logic , Buchtitel: Proceedings of the 6th International Conference on Language and Automata Theory and Applications. LNCS. Band: 7183. Seite(n): 389-400 Publication Link
DOI: 10.1007/978-3-642-28332-1_33

Michael Thomas (2012): On the Applicability of Post's Lattice , Journal: Information Processing Letters. Band: 112. Seite(n): 386-391 Publication Link
DOI: 10.1016/j.ipl.2012.02.002

Michael Thomas (2012): The Complexity of Circumscriptive Inference in Post's Lattice , Journal: Theory of Computing Systems. Herausgeber: Springer. Band: 50. Reihe: 50. Seite(n): 401--419 Publication Link
DOI: 10.1007/s00224-010-9311-6

Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer (2012): The Complexity of Reasoning for Fragments of Autoepistemic Logic , ACM Transactions on Computational Logic (TOCL). Herausgeber: ACM. Address: New York, NY, USA. Band: 13. Seite(n): 1--22 Publication Link
DOI: 10.1145/2159531.2159539

Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer (2012): Counting Classes and the Fine Structure between NC1 and L , Journal: Theoretical Computer Science. Band: 417. Seite(n): 36--49 Publication Link
DOI: 10.1016/j.tcs.2011.05.050

Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss (2012): The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers , Buchtitel: Proc. AIML'2012. Publication Link

Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Heribert Vollmer, Thomas Schneider, Michael Thomas (2011): Model Checking CTL is Almost Always Inherently Sequential , Journal: Logical Methods in Computer Science. Band: 7. Publication Link
DOI: 10.2168/LMCS-7(2:12)2011

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer (2011): The Complexity of Reasoning for Fragments of Default Logic , Journal: Journal of Logic and Computation. Publication Link
DOI: 10.1093/logcom/exq061

Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer (2011): Proof Complexity of Propositional Default Logic , Journal: Archive for Mathematical Logic. Herausgeber: Springer Berlin / Heidelberg. Band: 50. Seite(n): 727-742 Publication Link
DOI: 10.1007/s00153-011-0245-8

Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer (2011): Verifying Proofs in Constant Depth , Buchtitel: Proceedings 36th International Symposium on Mathematical Foundations of Computer Science. Herausgeber: Springer. Publication Link
DOI: 10.1007/978-3-642-22993-0_11

Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss (2010): The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part II , Buchtitel: International Workshop on Hybrid Logic and Applications. Publication Link

Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss (2010): The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I , Journal: Journal of Applied Logic. Band: 8. Seite(n): 409-421 Publication Link
DOI: 10.1016/j.jal.2010.08.001

Michael Thomas (2010): On the Complexity of Fragments of Nonmonotonic Logics , Dissertation Publication Link
ISBN: 978-3-86955-571-3

Michael Thomas, Heribert Vollmer (2010): Complexity of Non-Monotonic Logics , Journal: Bulletin of the EATCS. Band: 102. Seite(n): 53-82 Publication Link

Nadia Creignou, Johannes Schmidt, Michael Thomas (2010): Complexity of Propositional Abduction for Restricted Sets of Boolean Functions , Buchtitel: Proc. 12th International Conference on the Principles of Knowledge Representation and Reasoning. Herausgeber: AAAI Press. Publication Link

Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran (2010): Sets of Boolean Connectives that Make Argumentation Easier , Buchtitel: Proc. 12th European Conference on Logics in Artificial Intelligence. Herausgeber: Springer. Band: 6341. Reihe: 6341. Seite(n): 117-129 Publication Link

Olaf Beyersdorff, Arne Meier, Sebastian Möller, Michael Thomas, Heribert Vollmer (2010): Proof Complexity of Propositional Default Logic , Buchtitel: Proc. of the 13rd International Conference on Theory and Applications of Satisfiability Testing. Herausgeber: Springer. Band: 6175. Reihe: 6175. Seite(n): 30-43 Publication Link
DOI: 10.1007/978-3-642-14186-7_5

Pierre McKenzie, Michael Thomas, Heribert Vollmer (2010): Extensional Uniformity for Boolean Circuits , Journal: SIAM Journal on Computing. Band: 39. Seite(n): 3186-3206 Publication Link
DOI: 10.1137/080741811

Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer (2009): The Complexity of Satisfiability for Fragments of CTL and CTL* , Journal: International Journal of Foundations of Computer Science. Band: 20. Seite(n): 901-918 Publication Link
DOI: 10.1142/S0129054109006954

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer (2009): The Complexity of Propositional Implication , Journal: Information Processing Letters. Band: 109. Seite(n): 1071-1077 Publication Link
DOI: 10.1016/j.ipl.2009.06.015

Matthias Becker, Helena Szczerbicka, Michael Thomas (2007): Neural Networks and Optimization Algorithms applied for Construction of Low Noise Tread Profiles , Journal: Cybernetics and Systems. Band: 38. Seite(n): 535-548 Publication Link

Michael Thomas, Helena Szczerbicka (2007): Online Scheduling On Multiple Resources Under Stochastic Conditions , Journal: Systems Science. Band: 33. Seite(n): 23-30 Publication Link

Michael Thomas, Helena Szczerbicka (2007): Evaluating Online Scheduling Techniques in Uncertain Environments , Buchtitel: Proc. 3rd Multidisciplinary International Scheduling Conference: Theory and Applications. Address: Paris, Frankreich. Seite(n): 471-479 Publication Link

Michael Thomas (2006): Logics for Context-Free Languages , Schule: Universität Hannover, Institut fr Theoretische Informatik. Publication Link