Benjamin G. Rin

According to our database, Benjamin G. Rin authored at least 10 papers between 2013 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Hive Is PSPACE-Hard.

Daniël I. Andel, Benjamin G. Rin

Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2024

Arimaa Is PSPACE-Hard.

Benjamin G. Rin, Atze Schipper

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

Hamiltonian Paths and Cycles in NP-Complete Puzzles.

Marnix Deurloo, Mitchell Donkers, Mieke Maarse, Benjamin G. Rin, Karen Schutte

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2020

Reachability for infinite time Turing machines with long tapes.

Merlin Carl, Benjamin G. Rin, Philipp Schlicht

Log. Methods Comput. Sci., 2020

2018

Writability and reachability for alpha-tape infinite time Turing machines.

Merlin Carl, Benjamin G. Rin, Philipp Schlicht

CoRR, 2018

2017

Koepke Machines and Satisfiability for Infinitary Propositional Languages.

Merlin Carl, Benedikt Löwe, Benjamin G. Rin

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Realizability Semantics for Quantified Modal Logic: Generalizing Flagg's 1985 Construction.

Benjamin G. Rin, Sean Walsh

Rev. Symb. Log., 2016

2015

Transfinite recursion and computation in the iterative conception of set.

Benjamin G. Rin

Synth., 2015

2014

The computational strengths of α-tape infinite time Turing machines.

Benjamin G. Rin

Ann. Pure Appl. Log., 2014

2013

Actuality in Propositional Modal Logic.

Allen P. Hazen, Benjamin G. Rin, Kai Frederick Wehmeier

Stud Logica, 2013