Loading [MathJax]/extensions/tex2jax.js

Journal of Computer and System Sciences

1 - 6 out of 6Page size: 20
Order:

Publications

  1. 2021

  2. Published

    Descriptive complexity of #P functions: A new perspective

    Durand, A., Haak, A., Kontinen, J. A. & Vollmer, H., Mar 2021, In: Journal of Computer and System Sciences. 116, p. 40-54 15 p.

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

  3. 2011

  4. Published

    Unitarity plus causality implies localizability

    Arrighi, P., Nesme, V. & Werner, R. F., 2011, In: J. Comput. Syst. Sci.. 77, p. 372-378 7 p.

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

  5. 2009

  6. Published

    The complexity of satisfiability problems: Refining Schaefer's theorem.

    Allender, E., Bauland, M., Immerman, N., Schnoor, H. & Vollmer, H., 2009, In: J. Comput. Syst. Sci.. 75, 4, p. 245-254 10 p., 4.

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

  7. 2006

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

  9. 2001

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

  11. 1998

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