Publications
- Published
Verifying Proofs in Constant Depth.
Beyersdorff, O., Datta, S., Mahajan, M., Scharfenberger-Fabian, G., Sreenivasaiah, K., Thomas, M. & Vollmer, H., 2011, Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. p. 84-95Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
Verifying Proofs in Constant Depth
Beyersdorff, O., Datta, S., Krebs, A., Mahajan, M., Scharfenberger-Fabian, G., Sreenivasaiah, K., Thomas, M. & Vollmer, H., 2012, In: Electronic colloquium on computational complexity (ECCC). TR12-079Research output: Contribution to journal › Article › Research › peer review
- Published
Verifying proofs in constant depth.
Beyersdorff, O., Datta, S., Krebs, A., Mahajan, M., Scharfenberger-Fabian, G., Sreenivasaiah, K., Thomas, M. & Vollmer, H., 2013, In: ACM Trans. Comput. Theory. 5, 1, p. 2:1-2:23Research output: Contribution to journal › Article › Research › peer review
- Published
Uniformly defining complexity classes of functions
Kosub, S., Schmitz, H. & Vollmer, H., 1998Research output: Book/Report › Monograph › Research › peer review
- 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
- Published
Unified Foundations of Team Semantics via Semirings
Barlag, T., Hannula, M., Kontinen, J., Pardal, N. & Virtema, J., 2023, Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023. Marquis, P., Son, T. C. & Kern-Isberner, G. (eds.). p. 75-85 11 p. (Proceedings of the International Conference on Knowledge Representation and Reasoning).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
Towards systematic and automatic handling of execution traces associated with scenario-based models
Greenyer, J., Gritzner, D., Harel, D. & Marron, A., 2018, MODELSWARD 2018 - Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development. Hammoudi, S., Pires, L. F. & Selic, B. (eds.). p. 560-566 7 p.Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
Towards Automated Defect Analysis Using Execution Traces of Scenario-Based Models
Greenyer, J., Gritzner, D., Harel, D. & Marron, A., 1 Feb 2019, Model-Driven Engineering and Software Development: 6th International Conference, MODELSWARD 2018, Revised Selected Papers. Pires, L. F., Selic, B. & Hammoudi, S. (eds.). Springer Verlag, p. 335-354 20 p. (Communications in Computer and Information Science; vol. 991).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
The tractability of model checking for LTL - The good, the bad, and the ugly fragments.
Bauland, M., Mundhenk, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2011, In: ACM Trans. Comput. Log.. 12, 2, p. 13:1-13:28Research output: Contribution to journal › Article › Research › peer review
- Published
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
Bauland, M., Mundhenk, M., Schneider, T., Schnoor, H., Schnoor, I. & Vollmer, H., 2009, In: Electronic Notes in Theoretical Computer Science (ENTCS). 231, p. 277-292 16 p.Research output: Contribution to journal › Article › Research › peer review
- Published
The model checking fingerprints of CTL operators
Krebs, A., Meier, A. & Mundhenk, M., 1 Sept 2019, In: Acta informatica. 56, 6, p. 487-519 33 p.Research output: Contribution to journal › Article › Research › peer review
- Published
The model checking fingerprints of CTL operators
Krebs, A., Meier, A. & Mundhenk, M., 2015, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. Grandi, F., Lange, M. & Lomuscio, A. (eds.). IEEE Computer Society, p. 101-110 10 p. (CoRR).Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
- Published
The many faces of a translation
McKenzie, P., Schwentick, T., Thérien, D. & Vollmer, H., 2000Research output: Book/Report › Monograph › Research › peer review
- 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
- Published
The gap-language-technique revisited
Vollmer, H., 1991Research output: Book/Report › Monograph › Research › peer review
- Published
The descriptive complexity approach to LOGCFL
Lautemann, C., McKenzie, P., Schwentick, T. & Vollmer, H., 1999Research output: Book/Report › Monograph › Research › peer review
- 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
- 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
- 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
- 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