Institute of Theoretical Computer Science - Publications

121 - 140 out of 211Page size: 20

Sort by: Publication date

Publications

2012
Published
The complexity of reasoning for fragments of default logic.
Beyersdorff, O., Meier, A., Thomas, M. & Vollmer, H., 2012, In: J. Log. Comput.. 22, 3, p. 587-604
Research output: Contribution to journal › Article › Research › peer review
Published
Verifying Proofs in Constant Depth
Beyersdorff, O., Datta, S., Krebs, A., Mahajan, M., Scharfenberger-Fabian, G., Sreenivasaiah, K., Thomas, M. & Vollmer, H., 2012, In: Electron. Colloquium Comput. Complex.. TR12-079
Research output: Contribution to journal › Article › Research › peer review
2011
Published
Algorithms Unplugged
Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H. & Wagner, D., 2011, (Fachbuch)
Research output: Book/Report › Textbook › Transfer
Published
Dependence logic with a majority quantifier
Durand, A., Ebbing, J., Kontinen, J. & Vollmer, H., 2011, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Vol. abs/1109.4750. p. 252-263
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Published
Generalized Satisfiability for the Description Logic ALC - (Extended Abstract)
Meier, A. & Schneider, T., 2011, Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Ogihara, M. & Tarui, J. (eds.). Vol. 6648. p. 552-562 11 p. (Lecture Notes in Computer Science).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Published
Model Checking CTL is Almost Always Inherently Sequential
Beyersdorff, O., Meier, A., Mundhenk, M., Schneider, T., Thomas, M. & Vollmer, H., 2011, In: Log. Methods Comput. Sci.. 7, 2
Research output: Contribution to journal › Article › Research › peer review
Published
On the Complexity of Modal Logic Variants and their Fragments
Meier, A., 2011
Research output: Thesis › Doctoral thesis
Published
Proof complexity of propositional default logic.
Beyersdorff, O., Meier, A., Müller, S., Thomas, M. & Vollmer, H., 2011, In: Arch. Math. Log.. 50, 7-8, p. 727-742
Research output: Contribution to journal › Article › Research › peer review
Published
The tractability of model checking for LTL - The good, the bad, and the ugly fragments.
Bauland, M., Mundhenk, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2011, In: ACM Trans. Comput. Log.. 12, 2, p. 13:1-13:28
Research output: Contribution to journal › Article › Research › peer review
Published
Verifying Proofs in Constant Depth.
Beyersdorff, O., Datta, S., Mahajan, M., Scharfenberger-Fabian, G., Sreenivasaiah, K., Thomas, M. & Vollmer, H., 2011, Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. p. 84-95
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
2010
Published
10061 Abstracts Collection - Circuits, Logic, and Games.
Rossman, B., Schwentick, T., Thérien, D. & Vollmer, H., 2010, Circuits, Logic, and Games.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Published
10061 Executive Summary - Circuits, Logic, and Games.
Rossman, B., Schwentick, T., Thérien, D. & Vollmer, H., 2010, Circuits, Logic, and Games.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Published
Boolean Circuits as a Data Structure for Boolean Functions - Efficient Algorithms and Hard Problems
Böhler, E., Creignou, N., Galota, M., Reith, S., Schnoor, H. & Vollmer, H., 2010, In: Log. Methods Comput. Sci.. 8, 3
Research output: Contribution to journal › Article › Research › peer review
Published
Circuits, Logic, and Games
Rossman, B., Schwentick, T., Thérien, D. & Vollmer, H., 2010, In: Dagstuhl Seminar Proceedings. 10061
Research output: Contribution to journal › Conference article › Research › peer review
Published
Complexity of Non-Monotonic Logics
Thomas, M. & Vollmer, H., 2010, In: Bull. EATCS. 102, p. 53-82
Research output: Contribution to journal › Article › Research › peer review
Published
Complexity Results for Modal Dependence Logic
Lohmann, P. & Vollmer, H., 2010, Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings. Dawar, A. & Veith, H. (eds.). p. 411-425 15 p. (Lecture Notes in Computer Science).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Published
Counting classes and the fine structure between NC1 and L.
Datta, S., Mahajan, M., Rao, B. V. R., Thomas, M. & Vollmer, H., 2010, MFCS. p. 306-317 12 p.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Published
Counting classes and the fine structure between NC1 and L.
Datta, S., Mahajan, M., Rao, B. V. R., Thomas, M. & Vollmer, H., 2010, In: Electron. Colloquium Comput. Complex.. TR10
Research output: Contribution to journal › Article › Research › peer review
Published
Extensional Uniformity for Boolean Circuits
McKenzie, P., Thomas, M. & Vollmer, H., 2010, In: SIAM J. Comput.. 39, 7, p. 3186-3206 21 p., 7.
Research output: Contribution to journal › Article › Research › peer review
Published
On Second-Order Monadic Monoidal and Groupoidal Quantifiers
Kontinen, J. & Vollmer, H., 2010, In: Log. Methods Comput. Sci.. 6, 3
Research output: Contribution to journal › Article › Research › peer review

Previous 1...3 4 5 6 7 8 9 10 11 Next