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 215Page size: 20
Order:

Publications

  1. 1991

  2. Published

    The gap-language-technique revisited

    Vollmer, H., 1991

    Research output: Book/Report › Monograph › Research › peer review

  3. 1993

  4. Published

    On the power of polynomial time bit-reductions

    Hertrampf, U., Lautemann, C., Schwentick, T., Vollmer, H. & Wagner, K. W., 1993, Proceedings of the Eighth Annual Structure in Complexity Theory Conference.

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

  5. 1994

  6. Published

    On different reducibility notions for function classes

    Vollmer, H., 1994

    Research output: Book/Report › Monograph › Research › peer review

  7. 1995

  8. Published

    Complexity classes of optimization functions

    Vollmer, H. & Wagner, K. W., 1995, In: Information and computation.

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

  9. Published

    On the power of number-theoretic operations with respect to counting

    Hertrampf, U., Vollmer, H. & Wagner, K. W., 1995, Proceedings of the IEEE Annual Structure in Complexity Theory Conference.

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

  10. 1996

  11. Published

    Complements of multivalued functions

    Fenner, S., Green, F., Homer, S., Selman, A. L., Thierauf, T. & Vollmer, H., 1996, Proceedings of the Annual IEEE Conference on Computational Complexity.

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

  12. Published

    On balanced versus unbalanced computation trees

    Hertrampf, U., Vollmer, H. & Wagner, K. W., 1996, In: Theory of computing systems.

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

  13. Published

    On type-2 probabilistic quantifiers

    Book, R. V., Vollmer, H. & Wagner, K. W., 1996

    Research output: Book/Report › Monograph › Research › peer review

  14. Published

    Recursion theoretic characterizations of complexity classes of counting functions

    Vollmer, H. & Wagner, K. W., 1996, In: Theoretical computer science.

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

  15. Published

    Relations among parallel and sequential computation models

    Vollmer, H., 1996

    Research output: Book/Report › Monograph › Research › peer review

  16. 1997

  17. Published

    Gap-languages and log-time complexity classes

    Regan, K. W. & Vollmer, H., 1997, In: Theoretical computer science.

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

  18. Published

    On operators of higher types

    Vollmer, H. & Wagner, K. W., 1997, Proceedings of the Annual IEEE Conference on Computational Complexity.

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

  19. 1998

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

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

  22. Published

    Relating polynomial time to constant depth

    Vollmer, H., 1998, In: Theoretical computer science.

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

  23. Published

    The chain method to separate counting classes

    Cronauer, K., Hertrampf, U., Vollmer, H. & Wagner, K. W., 1998, In: Theory of computing systems.

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

  24. Published

    Uniformly defining complexity classes of functions

    Kosub, S., Schmitz, H. & Vollmer, H., 1998

    Research output: Book/Report › Monograph › Research › peer review

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

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

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

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