Follow
Igor Potapov
Igor Potapov
Professor, Department of Computer Science, University of Liverpool
Verified email at liverpool.ac.uk - Homepage
Title
Cited by
Cited by
Year
Gossiping with unit messages in known radio networks
L Gąsieniec, I Potapov
Foundations of Information Technology in the Era of Network and Mobile …, 2002
712002
Real-Time Traversal in Grammar-Based Compressed Files.
L Gasieniec, RM Kolpakov, I Potapov, P Sant
DCC, 458, 2005
602005
On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
PC Bell, I Potapov
International Journal of Foundations of Computer Science 21 (06), 963-978, 2010
442010
Reachability problems in quaternion matrix and rotation semigroups
P Bell, I Potapov
Information and Computation 206 (11), 1353-1361, 2008
412008
Temporal logic with predicate/spl lambda/-abstraction
A Lisitsa, I Potapov
12th International Symposium on Temporal Representation and Reasoning (TIME …, 2005
402005
Time efficient centralized gossiping in radio networks
L Gąsieniec, I Potapov, Q Xin
Theoretical computer science 383 (1), 45-58, 2007
39*2007
On undecidability bounds for matrix decision problems
P Bell, I Potapov
Theoretical Computer Science 391 (1-2), 3-13, 2008
362008
The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete
PC Bell, M Hirvensalo, I Potapov
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
342017
Decidability of the Membership Problem for 2 × 2 integer matrices
I Potapov, P Semukhin
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
342017
Deterministic communication in radio networks with large labels
L Gasieniec, A Pagourtzis, I Potapov, T Radzik
Algorithmica 47, 97-117, 2007
342007
Matrix equations and Hilbert's tenth problem
P Bell, V Halava, T Harju, J Karhumäki, I Potapov
International Journal of Algebra and Computation 18 (08), 1231-1241, 2008
262008
Mortality for 2× 2 matrices is NP-hard
PC Bell, M Hirvensalo, I Potapov
Mathematical Foundations of Computer Science 2012: 37th International …, 2012
242012
On the computational complexity of matrix semigroup problems
PC Bell, I Potapov
Fundamenta Informaticae 116 (1-4), 1-13, 2012
242012
Optimizing reachability sets in temporal graphs by delaying
A Deligkas, I Potapov
Information and Computation 285, 104890, 2022
232022
On the identity problem for the special linear group and the Heisenberg group
SK Ko, R Niskanen, I Potapov
45th International Colloquium on Automata, Languages, and Programming …, 2018
232018
Reachability problems in low-dimensional iterative maps
O Kurganskyy, I Potapov, F Sancho-Caparrini
International Journal of Foundations of Computer Science 19 (04), 935-951, 2008
20*2008
On decidability and complexity of low-dimensional robot games
R Niskanen, I Potapov, J Reichert
Journal of Computer and System Sciences 107, 124-141, 2020
18*2020
Membership and reachability problems for row-monomial transformations
A Lisitsa, I Potapov
International Symposium on Mathematical Foundations of Computer Science, 623-634, 2004
182004
Pushing lines helps: Efficient universal centralised transformations for programmable matter
A Almethen, O Michail, I Potapov
Theoretical Computer Science 830, 43-59, 2020
162020
Membership problem in GL (2, Z) extended by singular matrices
I Potapov, P Semukhin
Leibniz International Proceedings in Informatics, LIPIcs 83, 2017
162017
The system can't perform the operation now. Try again later.
Articles 1–20