Profile picture not found

Prof. Dr.  Heribert Vollmer

View graph of relations

Publications

  1. 2024
  2. Published

    Parameterized complexity of weighted team definability

    Kontinen, J., Mahmood, Y., Meier, A. & Vollmer, H., May 2024, In: Mathematical Structures in Computer Science. 34, 5, p. 375-389 15 p.

    Research output: Contribution to journalArticleResearchpeer review

  3. 2022
  4. Published

    Enumerating teams in first-order team logics

    Haak, A., Meier, A., Müller, F. & Vollmer, H., Dec 2022, In: Annals of Pure and Applied Logic. 173, 10, 103163.

    Research output: Contribution to journalArticleResearchpeer review

  5. Published

    Enumeration Classes Defined by Circuits

    Creignou, N., Durand, A. & Vollmer, H., 22 Aug 2022, 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022. Szeider, S., Ganian, R. & Silva, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 39. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 241).

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

  6. 2021
  7. Published

    Descriptive complexity of #P functions: A new perspective

    Durand, A., Haak, A., Kontinen, J. & Vollmer, H., Mar 2021, In: Journal of Computer and System Sciences. 116, p. 40-54 15 p.

    Research output: Contribution to journalArticleResearchpeer 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 proceedingConference contributionResearchpeer review

  9. 2020
  10. Published

    Satisfiability of modal inclusion logic: Lax and strict semantics

    Hella, L., Kuusisto, A., Meier, A. & Vollmer, H., 10 Jan 2020, In: ACM Transactions on Computational Logic. 21, 1, p. 1-18 18 p., 7.

    Research output: Contribution to journalArticleResearchpeer review

  11. 2019
  12. Published

    A complexity theory for hard enumeration problems

    Creignou, N., Kröll, M., Pichler, R., Skritek, S. & Vollmer, H., 15 Sept 2019, In: Discrete applied mathematics. 268, p. 191-209 19 p.

    Research output: Contribution to journalArticleResearchpeer review

  13. Published

    A model-theoretic characterization of constant-depth arithmetic circuits

    Haak, A. & Vollmer, H., Sept 2019, In: Annals of Pure and Applied Logic. 170, 9, p. 1008-1029 22 p.

    Research output: Contribution to journalArticleResearchpeer review

  14. Published

    Parameterised Enumeration for Modification Problems

    Creignou, N., Ktari, R., Meier, A., Müller, J. S., Olive, F. & Vollmer, H., Sept 2019, In: Algorithms. 12, 9, p. 189 1 p., 9.

    Research output: Contribution to journalArticleResearchpeer review

  15. Published

    Counting of teams in first-order team logics

    Haak, A., Kontinen, J., Müller, F., Vollmer, H. & Yang, F., 20 Aug 2019, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Rossmanith, P., Heggernes, P. & Katoen, J-P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. abs/1902.00246. p. 19:1-19:15 15 p. 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 138).

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

  16. Published

    Guest Editorial: Special Issue on Theoretical Aspects of Computer Science

    Vollmer, H. & Vallée, B., 15 Jul 2019, In: Theory of computing systems. 63, 5, p. 923-925 3 p., 5.

    Research output: Contribution to journalEditorial in journalResearchpeer review

  17. E-pub ahead of print

    Logics for Dependence and Independence: Report from Dagstuhl Seminar 19031

    Vollmer, H., Kontinen, J., Grädel, E. & Kolaitis, P. G., 19 Jun 2019, (E-pub ahead of print) In: Dagstuhl Reports. 9, 1, p. 28-46 19 p.

    Research output: Contribution to journalArticleResearch

  18. Published

    Künstlicher Geist?

    Vollmer, H., 6 Jan 2019, In: Christ in der Gegenwart. 2019, 1, p. 17-18

    Research output: Contribution to journalArticleTransfer

  19. 2018
  20. Published

    Die Zukunft der Menschheit: Pierre Teilhard de Cardin und die Künstliche Intelligenz

    Vollmer, H., Nov 2018, In: Herder-Korrespondenz. 2018, 11, p. 28-32

    Research output: Contribution to journalArticleResearch

  21. Published

    Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth

    Durand, A., Haak, A. & Vollmer, H., 9 Jul 2018, LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. New York: Association for Computing Machinery (ACM), p. 354-363 10 p. (Proceedings - Symposium on Logic in Computer Science).

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

  22. Published

    Complexity of propositional logics in team semantic

    Vollmer, H., Hannula, M., Kontinen, J. & Virtema, J., Jan 2018, In: ACM Transactions on Computational Logic. 19, 1, p. 2:1-2:14 14 p., 2.

    Research output: Contribution to journalArticleResearchpeer review

  23. Published

    Preface of STACS 2016 Special Issue

    Dürr, C. & Vollmer, H., Jan 2018, In: Theory of Computing Systems. 62, 1, p. 1-3 3 p.

    Research output: Contribution to journalEditorial in journalResearchpeer review

  24. 2017
  25. Published

    Modal independence logic

    Kontinen, J., Müller, J. S., Schnoor, H. & Vollmer, H., Jul 2017, In: Journal of Logic and Computation. 27, 5, p. 1333-1352 20 p.

    Research output: Contribution to journalArticleResearchpeer review

  26. Published

    Paradigms for Parameterized Enumeration

    Creignou, N., Meier, A., Müller, J. S., Schmidt, J. & Vollmer, H., 1 May 2017, In: Theory of Computing Systems. 60, 4, p. 737-758 22 p.

    Research output: Contribution to journalArticleResearchpeer review

  27. Published

    On the complexity of hard enumeration problems

    Creignou, N., Kröll, M., Pichler, R., Skritek, S. & Vollmer, H., 16 Feb 2017, Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings. Springer Verlag, p. 183-195 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10168 LNCS).

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Previous 1 2 3 4 5 6 7 8 Next