Browse by People


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


Potapov, I, Semukhin, Pavel and Bell, Paul
(2019) Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019-08-26 - 2019-08-30, Aachen, Germany.


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-01-16 - 2017-01-20, Limerick, Ireland.


Potapov, I and Semukhin, P
(2017) Membership problem in GL(2, Z) extended by singular matrices. .


Potapov, I, Niskanen, Reino and Reichert, J
(2019) On decidability and complexity of low-dimensional robot games. Journal of Computer and System Sciences.


Song, H and Potapov, I
(2019) Polygon approximations of the euclidean circles on the square grid by broadcasting sequences. .


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).


Ko, SK, Niskanen, R and Potapov, I
(2018) Reachability Problems in Nondeterministic Polynomial Maps on the Integers. .


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-08-22 - 2016-08-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-04-20 - 2017-04-22, Bern, Switzerland.


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-08-22 - 2016-08-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. 27 - 44.

This list was generated on Wed Nov 13 05:12:20 2019 GMT.