Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 5.


Niskanen, R ORCID: 0000-0002-2210-1481, Potapov, I and Reichert, J
(2020) On decidability and complexity of low-dimensional robot games. Journal of Computer and System Sciences, 107. pp. 124-141.


Niskanen, R ORCID: 0000-0002-2210-1481
(2018) Reachability games and related matrix and word problems. Doctor of Philosophy thesis, University of Liverpool.


Ko, SK, Niskanen, R ORCID: 0000-0002-2210-1481 and Potapov, I
(2021) Reachability problems in low-dimensional nondeterministic polynomial maps over integers. INFORMATION AND COMPUTATION, 281. p. 104785.


Potapov, I, Niskanen, R ORCID: 0000-0002-2210-1481 and Reichert, J
(2016) Undecidability of Two-dimensional Robot Games. In: 41st International Symposium on Mathematical Foundations of Computer Science, 2016-8-22 - 2016-8-26, Krakow (Poland).


Halava, V, Harju, T, Niskanen, R ORCID: 0000-0002-2210-1481 and Potapov, I
(2017) Weighted Automata on Infinite Words in the Context of Attacker-Defender Games. Information and Computation, 255 (1). pp. 27-44.

This list was generated on Sun Feb 25 11:01:39 2024 GMT.