Institute of Theoretical Computer Science - Publications

1 - 20 out of 215Page size: 20

Select page size:

Sort by: Title

Sort by:

Order:

Asc.

Desc.

Publications

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
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France
Ollinger, N. & Vollmer, H., 2016, In: Leibniz International Proceedings in Informatics, LIPIcs. 47
Research output: Contribution to journal › Editorial in journal › Research
Published
34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany
Vollmer, H. & Vallée, B., 2017, In: Leibniz International Proceedings in Informatics, LIPIcs. 66
Research output: Contribution to journal › Editorial in journal › Research
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 journal › Article › Research › peer review
Published
A Fragment of Dependence Logic Capturing Polynomial Time
Ebbing, J., Kontinen, J., Müller, J. & Vollmer, H., 2014, In: Logical Methods in Computer Science, Volume. 10, 3
Research output: Contribution to journal › Article › Research › peer review
Published
A generalization of the Büchi-Elgot-Trakhtenbrot theorem
Galota, M. & Vollmer, H., 2001, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
Research output: Contribution to journal › Article › Research › peer review
Published
A generalized quantifier concept in computational complexity theory
Vollmer, H., 1999
Research output: Book/Report › Monograph › Research › peer review
Published
A Generalized Quantifier Concept in Computational Complexity Theory
Vollmer, H., 28 Sept 1998, f. (Annals of Pure and Applied Logic).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research
Published
Algorithmic local monomialization of a binomial: a comparison of different approaches
Gaube, S. A. & Schober, B., 9 Dec 2022, In: International Journal of Algebra and Computation. 33, 1, p. 161-195
Research output: Contribution to journal › Article › Research › peer review
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
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
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 journal › Article › Research › peer review
Published
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits
Haak, A. & Vollmer, H., 6 Aug 2016, Logic, Language, Information, and Computation: 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings. Väänänen, J., Hirvonen, Å. & de Queiroz, R. (eds.). Berlin: Springer Verlag, p. 234-248 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9803 LNCS).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
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
Published
A parameterized view on the complexity of dependence and independence logic
Kontinen, J., Meier, A. & Mahmood, Y., Dec 2022, In: J. Log. Comput.. 32, 8, p. 1624-1644 21 p.
Research output: Contribution to journal › Article › Research › peer review
Published
A Parameterized View on the Complexity of Dependence Logic.
Kontinen, J., Meier, A. & Mahmood, Y., 2022, Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings.. Artemov, S. & Nerode, A. (eds.). Cham, p. 125-142 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13137 LNCS).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Published
A polynomial-time approximation scheme for base station positioning in UMTS networks
Galota, M., Glaßer, C., Reith, S. & Vollmer, H., 2001, Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), Rome, Italy, July 21, 2001. Association for Computing Machinery (ACM), p. 52-59 8 p.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
Published
Approximation and dependence via multiteam semantics
Durand, A., Hannula, M., Kontinen, J., Meier, A. & Virtema, J., Aug 2018, In: Annals of Mathematics and Artificial Intelligence. 83, 3-4, p. 297-320 24 p.
Research output: Contribution to journal › Article › Research › peer review
Published
Approximation and Dependence via Multiteam Semantics
Durand, A., Hannula, M., Kontinen, J., Meier, A. & Virtema, J., 4 Mar 2016, Foundations of Information and Knowledge Systems: 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings. Gyssens, M. & Simari, G. (eds.). Cham, p. 271-291 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9616).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review

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