Institute of Theoretical Computer Science - Publications

181 - 200 out of 215Page size: 20

Sort by: Publication date

Publications

2003
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., 2002
Research output: Book/Report › Monograph › Research › peer review
Published
Partially-ordered two-way automata: A new characterization of DA
Schwentick, T., Therien, D. & Vollmer, H., 2002
Research 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
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
The descriptive complexity approach to LOGCFL
Lautemann, C., McKenzie, P., Schwentick, T. & Vollmer, H., 2001, In: Journal of Computer and System Sciences.
Research output: Contribution to journal › Article › Research › peer review
2000
Published
Arithmetic circuits and polynomial replacement systems
McKenzie, P., Vollmer, H. & Wagner, K. W., 2000
Research output: Book/Report › Monograph › Research › peer review
Published
Note on closure properties of logspace MOD classes
Hertrampf, U., Reith, S. & Vollmer, H., 2000, In: Information processing letters.
Research output: Contribution to journal › Article › Research › peer review
Published
On the autoreducibility of random sequences
Ebert, T. & Vollmer, H., 2000
Research output: Book/Report › Monograph › Research › peer review
Published
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Reith, S. & Vollmer, H., 2000
Research output: Book/Report › Monograph › Research › peer review
Published
The many faces of a translation
McKenzie, P., Schwentick, T., Thérien, D. & Vollmer, H., 2000
Research output: Book/Report › Monograph › Research › peer review
Published
Uniform characterizations of complexity classes of functions
Kosub, S., Schmitz, H., Vollmer, H. & Cai, J., 2000, In: International Journal of Foundations of Computer Science.
Research output: Contribution to journal › Article › Research › peer review
1999
Published
A generalized quantifier concept in computational complexity theory
Vollmer, H., 1999
Research output: Book/Report › Monograph › Research › peer review
Published
Finite automata with generalized acceptance criteria
Peichl, T. & Vollmer, H., 1999
Research output: Book/Report › Monograph › Research › peer review
Published
The descriptive complexity approach to LOGCFL
Lautemann, C., McKenzie, P., Schwentick, T. & Vollmer, H., 1999
Research output: Book/Report › Monograph › Research › peer review
1998
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
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Reith, S. & Vollmer, H., 28 Sept 1998.
Research output: Working paper/Preprint › Technical report › Research
Published
The descriptive complexity approach to LOGCFL
Lautemann, C., McKenzie, P., Schwentick, T. & Vollmer, H., 28 Sept 1998.
Research output: Working paper/Preprint › Technical report › Research
Published
Nondeterministic NC1 Computation
Caussinus, H., McKenzie, P., Thérien, D. & Vollmer, H., 1998, In: Journal of Computer and System Sciences.
Research output: Contribution to journal › Article › Research › peer review
Published
Probabilistic type-2 operators and "almost"-classes
Book, R. V., Vollmer, H. & Wagner, K. W., 1998, In: Computational complexity.
Research output: Contribution to journal › Article › Research › peer review

Previous 1...6 7 8 9 10 11 Next