Image/logo of the organisation entitled Institute of Theoretical Computer Science

Institute of Theoretical Computer Science

Organisational unit: Institute

Type of address: Visitor address.
Appelstraße 9a
30167
Hannover
View graph of relations
201 - 211 out of 211Page size: 20

Publications

  1. 1997
  2. 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

  3. 1996
  4. 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

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

  6. Published

    On type-2 probabilistic quantifiers

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

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

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

  8. Published

    Relations among parallel and sequential computation models

    Vollmer, H., 1996

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

  9. 1995
  10. 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

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

  12. 1994
  13. Published

    On different reducibility notions for function classes

    Vollmer, H., 1994

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

  14. 1993
  15. 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

  16. 1991
  17. Published

    The gap-language-technique revisited

    Vollmer, H., 1991

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

Previous 1...7 8 9 10 11 Next