Profile picture not found

Prof. Dr.  Heribert Vollmer

https://orcid.org/0000-0002-9292-1960
View graph of relations
121 - 140 out of 146Page size: 20

Publications

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

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

  4. 1999

  5. What does the complexity theory do for the practice?

    Vollmer, H., Oct 1999, In: Informatik-Spektrum. 22, 5, p. 317-327 11 p.

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

  6. Published

    A generalized quantifier concept in computational complexity theory

    Vollmer, H., 1999

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

  7. Published

    Finite automata with generalized acceptance criteria

    Peichl, T. & Vollmer, H., 1999

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

  8. Published

    The descriptive complexity approach to LOGCFL

    Lautemann, C., McKenzie, P., Schwentick, T. & Vollmer, H., 1999

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

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

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

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

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

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

  15. Published

    Relating polynomial time to constant depth

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

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

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

  17. Published

    Uniformly defining complexity classes of functions

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

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

  18. 1997
  19. 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

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

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

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

  24. Published

    On type-2 probabilistic quantifiers

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

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

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

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