Publications
- 2008
- Published
The Complexity of Satisfiability for Fragments of CTL and CTL*
Meier, A., Mundhenk, M., Thomas, M. & Vollmer, H., 2008, Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). Vol. 223. p. 201-213 13 p. (Electron. Notes Theor. Comput. Sci.).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- 2007
- Published
Circuits, Logic, and Games, 06451
Schwentick, T., Thérien, D. & Vollmer, H., 2007, In: Dagstuhl Seminar Proceedings. 6451Research output: Contribution to journal › Conference article › Research › peer review
- Published
Computational complexity of constraint satisfaction
Vollmer, H., 2007, Computation and Logic in the Real World - Third Conference on Computability in Europe, CiE 2007, Proceedings. p. 748-757 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4497 LNCS).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- 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
- 2006
- Published
Exploiting practical limitations of UML diagrams for model validation and execution
Steimann, F. & Vollmer, H., Apr 2006, In: Software and systems modeling. 5, 1, p. 26-47 22 p.Research output: Contribution to journal › Article › Research › peer review
- Published
Executive Summary of Dagstuhl-Seminar Complexity of Constraints, 06401
Creignou, N., Kolaitis, P. G. & Vollmer, H., 2006, In: Dagstuhl Seminar Proceedings. 6401Research output: Contribution to journal › Conference article › Research › peer review
- Published
The many faces of a translation
McKenzie, P., Schwentick, T., Thérien, D. & Vollmer, H., 2006, In: Journal of Computer and System Sciences.Research output: Contribution to journal › Article › Research › peer review
- 2005
- Published
Bases for Boolean co-clones
Böhler, E., Reith, S., Schnoor, H. & Vollmer, H., 31 Oct 2005, In: Information processing letters. 96, 2, p. 59-66 8 p.Research output: Contribution to journal › Article › Research › peer review
- Published
The complexity of base station positioning in cellular networks
Glaßer, C., Reith, S. & Vollmer, H., 30 Apr 2005, In: Discrete applied mathematics. 148, 1, p. 1-12 12 p.Research output: Contribution to journal › Article › 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
Functions computable in polynomial space
Galota, M. & Vollmer, H., 2005, In: Information and computation.Research output: Contribution to journal › Article › Research › peer review
- 2004
- Published
Arithmetic circuits and polynomial replacement systems
Mckenzie, P., Vollmer, H. & Wagner, K. W., 2004, In: SIAM journal on computing.Research output: Contribution to journal › Article › Research › peer review
- Published
The complexity of Boolean constraint isomorphism
Böhler, E., Hemaspaandra, E., Reith, S. & Vollmer, H., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Diekert, V. & Habib, M. (eds.). Springer Verlag, p. 164-175 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2996).Research output: Chapter in book/report/conference proceeding › Contribution to book/anthology › Research › peer review
- 2003
- Published
Complexity theory made easy: The formal language approach to the definition of complexity classes
Vollmer, H., 2003Research output: Book/Report › Monograph › Research › peer review
- Published
Generic separations and leaf languages
Galota, M., Kosub, S. & Vollmer, H., 2003, In: Mathematical logic quarterly.Research output: Contribution to journal › Article › Research › peer review
- Published
On the autoreducibility of random sequences
Ebert, T., Merkle, W. & Vollmer, H., 2003, In: SIAM journal on computing.Research output: Contribution to journal › Article › Research › peer review
- Published
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Reith, S. & Vollmer, H., 2003, In: Inf. Comput.. 186, 1, p. 1-19 19 p.Research output: Contribution to journal › Article › Research › peer review
- 2002
- Published
Equivalence and isomorphism for boolean constraint satisfaction
Böhler, E., Hemaspaandra, E., Reith, S. & Vollmer, H., 2002Research output: Book/Report › Monograph › Research › peer review
- Published
Partially-ordered two-way automata: A new characterization of DA
Schwentick, T., Therien, D. & Vollmer, H., 2002Research output: Book/Report › Monograph › Research › peer review
- 2001
- 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