201 - 215 out of 215Page size: 20

• 10
• 20
• 40
• 80
• 160
• All

Select page size:10204080160

Sort by: Publication date

• Publication date
• Title
• Type
• 1st author

Sort by:Publication dateTitleType1st author

Order:

Asc.

Desc.

Publications

1. 1998

2. Published

   Relating polynomial time to constant depth

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

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

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

4. Published

   Uniformly defining complexity classes of functions

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

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

5. 1997

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

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

8. 1996

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

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

11. Published

    On type-2 probabilistic quantifiers

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

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

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

13. Published

    Relations among parallel and sequential computation models

    Vollmer, H., 1996

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

14. 1995

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

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

17. 1994

18. Published

    On different reducibility notions for function classes

    Vollmer, H., 1994

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

19. 1993

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

21. 1991

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