Up a level |
Adamson, D ORCID: 0000-0003-3343-2435, Deligkas, A, Gusev, VV and Potapov, I
(2022)
The Complexity of Periodic Energy Minimisation.
, 2022-8-22 - 2022-9-26.
Bell, P, Hirvensalo, M and Potapov, I
(2017)
The Identity Problem for Matrix Semigroups in SL2(Z) is NP-complete.
In: SIAM: ACM-SIAM Symposium on Discrete Algorithms (SODA17), 2017-1-16 - 2017-1-19.
Potapov, I and Ko, S
(2017)
Matrix Semigroup Freeness Problems in SL (2, \mathbb Z).
In: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, 2017-1-16 - 2017-1-20, Limerick, Ireland.
Potapov, I and Semukhin, P
(2017)
Membership problem in GL(2, Z) extended by singular matrices.
In: MFCS, 2017-8-21 - 2017-8-25, Aalborg, Denmark.
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.
Almethen, Abdullah, Michail, O ORCID: 0000-0002-6234-3960 and Potapov, I
(2019)
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter.
In: International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS).
Potapov, I, Bournez, Olivier and Kurganskyy, Oleksiy
(2018)
Reachability Problems for One-Dimensional Piecewise Affine Maps.
International Journal of Foundations of Computer Science, 29 (4).
pp. 529-549.
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.
Kurganskyy, O and Potapov, I
(2016)
SOFSEM 2016: Theory and Practice of Computer Science.
SOFSEM 2016: Theory and Practice of Computer Science, 9587.
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).
Potapov, I and Ko, S
(2017)
Vector Ambiguity and Freeness Problems in SL (2, ℤ).
In: Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, 2017-4-20 - 2017-4-22, Bern, Switzerland.
Semukhin, P and Potapov, I
(2019)
Vector Reachability Problem in SL(2,Z).
Journal of Computer and System Sciences, 100.
pp. 30-43.
Potapov, I and Semukhin, P
(2016)
Vector Reachability Problem in SL(2,Z).
In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016-8-22 - 2016-8-26, Krakow (Poland).
Potapov, I and Semukhin, P
(2016)
Vector reachability problem in SL (2, ℤ).
.
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.