Profile picture not found

Prof. Dr.  Heribert Vollmer

https://orcid.org/0000-0002-9292-1960
View graph of relations
101 - 120 out of 147Page size: 20

Publications

  1. 2006
  2. Published

    The many faces of a translation

    McKenzie, P., Schwentick, T., Thérien, D. & Vollmer, H., 2006, In: Journal of Computer and System Sciences.

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

  3. 2005
  4. Published

    Bases for Boolean co-clones

    Böhler, E., Reith, S., Schnoor, H. & Vollmer, H., 31 Oct 2005, In: Information processing letters. 96, 2, p. 59-66 8 p.

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

  5. Published

    The complexity of base station positioning in cellular networks

    Glaßer, C., Reith, S. & Vollmer, H., 30 Apr 2005, In: Discrete applied mathematics. 148, 1, p. 1-12 12 p.

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

  6. Published

    An algebraic approach to the complexity of generalized conjunctive queries

    Bauland, M., Chapdelaine, P., Creignou, N., Hermann, M. & Vollmer, H., 2005, In: Lecture Notes in Computer Science. 3542, p. 30-45 16 p.

    Research output: Contribution to journal › Conference article › Research › peer review

  7. Published

    Functions computable in polynomial space

    Galota, M. & Vollmer, H., 2005, In: Information and computation.

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

  8. Published

    The complexity of satisfiability problems: Refining Schaefer's theorem

    Allender, E., Bauland, M., Immerman, N., Schnoor, H. & Vollmer, H., 2005, In: Lecture Notes in Computer Science. 3618, p. 71-82 12 p.

    Research output: Contribution to journal › Conference article › Research › peer review

  9. 2004
  10. Published

    Arithmetic circuits and polynomial replacement systems

    Mckenzie, P., Vollmer, H. & Wagner, K. W., 2004, In: SIAM journal on computing.

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

  11. Published

    The complexity of Boolean constraint isomorphism

    Böhler, E., Hemaspaandra, E., Reith, S. & Vollmer, H., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Diekert, V. & Habib, M. (eds.). Springer Verlag, p. 164-175 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2996).

    Research output: Chapter in book/report/conference proceeding › Contribution to book/anthology › Research › peer review

  12. 2003
  13. Published

    Complexity theory made easy: The formal language approach to the definition of complexity classes

    Vollmer, H., 2003

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

  14. Published

    Generic separations and leaf languages

    Galota, M., Kosub, S. & Vollmer, H., 2003, In: Mathematical logic quarterly.

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

  15. Published

    On the autoreducibility of random sequences

    Ebert, T., Merkle, W. & Vollmer, H., 2003, In: SIAM journal on computing.

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

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

  17. 2002
  18. 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

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

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

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

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

  24. 2000
  25. Published

    Arithmetic circuits and polynomial replacement systems

    McKenzie, P., Vollmer, H. & Wagner, K. W., 2000

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

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

  27. Published

    On the autoreducibility of random sequences

    Ebert, T. & Vollmer, H., 2000

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

Previous 12 3 4 5 6 7 8 Next