Dr Reino Niskanen

School of Computer Science and Mathematics

Degrees

2018, University of Liverpool, United Kingdom, PhD
2013, University of Turku, Finland, MSc
2013, University of Turku, Finland, BSc

Academic appointments

Lecturer, Liverpool John Moores University, 2021 - present

Journal article

Ko SK, Niskanen R, Potapov I. 2021. Reachability problems in low-dimensional nondeterministic polynomial maps over integers INFORMATION AND COMPUTATION, 281 DOI Author Url

Niskanen R, Potapov I, Reichert J. 2020. On decidability and complexity of low-dimensional robot games JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 107 :124-141 DOI Author Url

Halava V, Harju T, Niskanen R, Potapov I. 2017. Weighted automata on infinite words in the context of Attacker-Defender games INFORMATION AND COMPUTATION, 255 :27-44 DOI Author Url

Halava V, Matiyasevich Y, Niskanen R. 2017. Small Semi-Thue System Universal with Respect to the Termination Problem FUNDAMENTA INFORMATICAE, 154 :177-184 DOI Author Url

Conference publication

Halava V, Harju T, Niskanen R, Potapov I. 2021. Integer Weighted Automata on Infinite Words Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 12811 LNCS :167-179 DOI

Barceló P, Hong CD, Le XB, Lin AW, Niskanen R. 2019. Monadic decomposability of regular relations Leibniz International Proceedings in Informatics, LIPIcs, 132 DOI Author Url

Ko SK, Niskanen R, Potapov I. 2018. On the identity problem for the special linear group and the heisenberg group Leibniz International Proceedings in Informatics, LIPIcs, 107 DOI Author Url

Ko SK, Niskanen R, Potapov I. 2018. Reachability Problems in Nondeterministic Polynomial Maps on the Integers Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11088 LNCS :465-477 DOI

Niskanen R. 2017. Reachability problem for polynomial iteration is PSPACE-complete Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10506 LNCS :132-143 DOI

Niskanen R, Potapov I, Reichert J. 2016. Undecidability of two-dimensional robot games Leibniz International Proceedings in Informatics, LIPIcs, 58 DOI Author Url

Niskanen R. 2016. Robot Games with States in Dimension One Larsen KG, Potapov I, Srba J. REACHABILITY PROBLEMS, RP 2016, 10th International Workshop on Reachability Problems (RP) 9899 :163-176 DOI Author Url

Halava V, Niskanen R, Potapov I. 2015. On robot games of Degree two Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8977 :224-236 DOI

Halava V, Harju T, Niskanen R, Potapov I. 2015. Weighted Automata on Infinite Words in the Context of Attacker-Defender Games Beckmann A, Mitrana V, Soskova M. EVOLVING COMPUTABILITY, 11th Conference on Computability in Europe (CiE) 9136 :206-215 DOI Author Url

Top