Loading [MathJax]/extensions/tex2jax.js
Image/logo of the organisation entitled Institute of Theoretical Computer Science

Institute of Theoretical Computer Science

Organisational unit: Institute

Type of address: Visitor addres
Appelstraße 9a
30167
Hannover
1 - 20 out of 217Page size: 20
Sort by: 1st author
Order:

Publications

  1. Published

    Introduction

    Abramsky, S., Kontinen, J., Väänänen, J. & Vollmer, H., 2016, Logics for Dependence and Independence. Cham, p. 1-3

    Research output: Chapter in book/report/conference proceeding › Contribution to book/anthology › Research › peer review

  2. Published

    Dependence Logic - Theory and Applications (Dagstuhl Seminar 13071).

    Abramsky, S., Kontinen, J., Väänänen, J. A. & Vollmer, H., 2013

    Research output: Other contribution › Other publication › Research

  3. Published

    Dependence Logic, Theory and Applications

    Abramsky, S., Kontinen, J., Väänänen, J. & Vollmer, H., 2016, Dependence Logic: Theory and Applications. Cham, (Logics for Dependence and Independence).

    Research output: Chapter in book/report/conference proceeding › Foreword/postscript › Research

  4. Published

    The complexity of satisfiability problems: Refining Schaefer's theorem.

    Allender, E., Bauland, M., Immerman, N., Schnoor, H. & Vollmer, H., 2009, In: J. Comput. Syst. Sci.. 75, 4, p. 245-254 10 p., 4.

    Research output: Contribution to journal › Article › Research › peer review

  5. Published

    The complexity of satisfiability problems: Refining Schaefer's theorem

    Allender, E., Bauland, M., Immerman, N., Schnoor, H. & Vollmer, H., 2005, In: Lecture Notes in Computer Science. 3618, p. 71-82 12 p.

    Research output: Contribution to journal › Conference article › Research › peer review

  6. Published

    LoCo - A Logic for Configuration Problems.

    Aschinger, M., Drescher, C., Gottlob, G. & Vollmer, H., 2014, In: ACM Trans. Comput. Log.. 15, 3, p. 20:1-20:25

    Research output: Contribution to journal › Article › Research › peer review

  7. Published

    LoCo - A Logic for Configuration Problems.

    Aschinger, M., Drescher, C. & Vollmer, H., 2012, p. 73-78.

    Research output: Contribution to conference › Paper › Research › peer review

  8. Published

    A Logical Characterization of Constant-Depth Circuits over the Reals

    Barlag, T. & Vollmer, H., 2021, Logic, Language, Information, and Computation: 27th International Workshop, WoLLIC 2021, Virtual Event, October 5–8, 2021, Proceedings. Silva, A., Wassermann, R. & de Queiroz, R. (eds.). Vol. abs/2005.04916. p. 16-30 15 p. (Lecture Notes in Computer Science (LNCS); vol. 13038).

    Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

  9. Published

    Unified Foundations of Team Semantics via Semirings

    Barlag, T., Hannula, M., Kontinen, J., Pardal, N. & Virtema, J., 2023, Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023. Marquis, P., Son, T. C. & Kern-Isberner, G. (eds.). p. 75-85 11 p. (Proceedings of the International Conference on Knowledge Representation and Reasoning).

    Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

  10. Published

    Logical characterizations of algebraic circuit classes over integral domains

    Barlag, T., Chudigiewitsch, F. & Gaube, S. A., May 2024, In: Mathematical Structures in Computer Science. 34, 5, p. 346-374 29 p.

    Research output: Contribution to journal › Article › Research › peer review

  11. E-pub ahead of print

    Logic and Computation Through the Lens of Semirings

    Barlag, T., Fröhlich, N., Hankala, T., Hannula, M., Hirvonen, M., Holzapfel, V., Kontinen, J., Meier, A. & Strieker, L., 18 Feb 2025, (E-pub ahead of print).

    Research output: Working paper/Preprint › Technical report › Research

  12. Published

    Graph Neural Networks and Arithmetic Circuits

    Barlag, T., Holzapfel, V., Strieker, L., Virtema, J. & Vollmer, H., 2024, In: Advances in Neural Information Processing Systems. 37

    Research output: Contribution to journal › Conference article › Research › peer review

  13. 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

  14. Published

    The Complexity of Problems for Quantified Constraints.

    Bauland, M., Böhler, E., Creignou, N., Reith, S., Schnoor, H. & Vollmer, H., 2010, In: Theory Comput. Syst.. 47, 2, p. 454-490

    Research output: Contribution to journal › Article › Research › peer review

  15. Published

    The Complexity of Generalized Satisfiability for Linear Temporal Logic

    Bauland, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2009, In: Log. Methods Comput. Sci.. 5, 1, 1.

    Research output: Contribution to journal › Article › Research › peer review

  16. 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., 2009, In: Electronic Notes in Theoretical Computer Science (ENTCS). 231, p. 277-292 16 p.

    Research output: Contribution to journal › Article › Research › peer review

  17. Published

    The complexity of generalized satisfiability for linear temporal logic

    Bauland, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2007, Foundations of Software Science and Computational Structures - 10th International Conference, FOSSACS 2007. Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007. Springer Verlag, p. 48-62 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4423 LNCS).

    Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

  18. Published

    An algebraic approach to the complexity of generalized conjunctive queries

    Bauland, M., Chapdelaine, P., Creignou, N., Hermann, M. & Vollmer, H., 2005, In: Lecture Notes in Computer Science. 3542, p. 30-45 16 p.

    Research output: Contribution to journal › Conference article › Research › peer review

  19. Published

    The Complexity of Generalized Satisfiability for Linear Temporal Logic

    Bauland, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 28 Dec 2008, In: Logical Methods in Computer Science, Volume.

    Research output: Contribution to journal › Article › Research › peer review

  20. Published

    SAT and Interactions (Dagstuhl Seminar 16381).

    Beyersdorff, O., Creignou, N., Egly, U. & Vollmer, H., 2016

    Research output: Other contribution › Other publication › Research

Previous 1 2 3 4 5 6 7 8 ...11 Next