Publications
2026
Scholarly publications
Rin, B., & Andel, D. I. (2026). Hive is PSPACE-Hard. In 13th International Conference on Fun with Algorithms (FUN 2026) (pp. 13:1–13:20). (Leibniz International Proceedings in Informatics). Dagstuhl Publishing. Advance online publication. [Portal]
2024
Scholarly publications
Deurloo, M., Donkers, M., Maarse, M., Rin, B. G., & Schutte, K. (2024). Hamiltonian Paths and Cycles in NP-Complete Puzzles. In A. Z. Broder, & T. Tamir (Eds.), 12th International Conference on Fun with Algorithms, FUN 2024 Article 11 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 291). Dagstuhl Publishing. [DOI] [Portal]
2020
Scholarly publications
Rin, B., Carl, M., & Schlicht, P. (2020). Reachability for infinite time Turing machines with long tapes. Logical Methods in Computer Science, 16(2), 2:1–2:16. [DOI] [Repository]
2017
Scholarly publications
Carl, M., Löwe, B., & Rin, B. (2017). Koepke Machines and Satisfiability for Infinitary Propositional Languages. In J. Kari, F. Manea, & I. Petre (Eds.), Unveiling Dynamics and Complexity: 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings (pp. 187-197). (Lecture Notes in Computer Science ; Vol. 10307). Springer. [DOI] [Repository]
2016
Scholarly publications
Rin, B. G., & Walsh, S. (2016). Realizability Semantics for Quantified Modal Logic: Generalizing Flagg's 1985 Construction. Review of Symbolic Logic, 9(4), 752-809. [DOI] [Repository]
2015
Scholarly publications
Rin, B. (2015). Transfinite Recursion and Computation in the Iterative Conception of Set. Synthese, 192(8), 2437–2462. [DOI]
2014
Scholarly publications
Rin, B. (2014). The computational strengths of α-tape infinite time Turing machines. Annals of Pure and Applied Logic, 165(9), 1501-1511. [DOI]
2013
Scholarly publications
Hazen, A., Rin, B., & Wehmeier, K. (2013). Actuality in Propositional Modal Logic. Studia Logica, 101(3), 487–503. [DOI]