Reino Niskanen

University of Liverpool, University of Oxford

Papers

Total Citations

H-Index

About

Reino Niskanen’s research lies at the intersection of theoretical computer science and combinatorial game theory, with a sharp focus on the decidability and complexity of robot games—two-player vector addition games played on integer lattices. His major contributions center on understanding the fundamental limits of computation in low-dimensional settings. In his most cited work, “Undecidability of Two-dimensional Robot Games” (2016, 5 citations), Niskanen proved that robot games in two dimensions are undecidable, establishing a critical boundary for algorithmic solvability. He further refined this picture in “On decidability and complexity of low-dimensional robot games” (2019, 5 citations), where he characterized the precise conditions under which these games become tractable or remain intractable. His earlier paper, “On Robot Games of Degree Two” (2015, 4 citations), explored the role of vector set size, while “Robot Games with States in Dimension One” (2016, 2 citations) examined the simplest nontrivial case. Though his citation counts are modest, Niskanen’s work is foundational for researchers studying infinite-state games, automata theory, and the decidability frontier—making him a key figure in this niche but impactful area.