| 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 | 72 | 2002 |
| Real-Time Traversal in Grammar-Based Compressed Files. L Gasieniec, RM Kolpakov, I Potapov, P Sant DCC, 458, 2005 | 62 | 2005 |
| 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 | 51 | 2010 |
| Reachability problems in quaternion matrix and rotation semigroups P Bell, I Potapov Information and Computation 206 (11), 1353-1361, 2008 | 47 | 2008 |
| Time efficient centralized gossiping in radio networks L Gąsieniec, I Potapov, Q Xin Theoretical computer science 383 (1), 45-58, 2007 | 40* | 2007 |
| Temporal logic with predicate/spl lambda/-abstraction A Lisitsa, I Potapov 12th International Symposium on Temporal Representation and Reasoning (TIME …, 2005 | 40 | 2005 |
| 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 | 39 | 2017 |
| On undecidability bounds for matrix decision problems P Bell, I Potapov Theoretical Computer Science 391 (1-2), 3-13, 2008 | 39 | 2008 |
| 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 | 36 | 2017 |
| Deterministic communication in radio networks with large labels L Gasieniec, A Pagourtzis, I Potapov, T Radzik Algorithmica 47, 97-117, 2007 | 33 | 2007 |
| 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 | 31 | 2008 |
| Optimality guarantees for crystal structure prediction VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ... Nature 619 (7968), 68-72, 2023 | 29 | 2023 |
| Mortality for 2× 2 matrices is NP-hard PC Bell, M Hirvensalo, I Potapov Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 29 | 2012 |
| Optimizing reachability sets in temporal graphs by delaying A Deligkas, I Potapov Information and Computation 285, 104890, 2022 | 28 | 2022 |
| On the computational complexity of matrix semigroup problems PC Bell, I Potapov Fundamenta Informaticae 116 (1-4), 1-13, 2012 | 28 | 2012 |
| 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 | 24 | 2018 |
| Membership and reachability problems for row-monomial transformations A Lisitsa, I Potapov International Symposium on Mathematical Foundations of Computer Science, 623-634, 2004 | 23 | 2004 |
| From Post systems to the reachability problems for matrix semigroups and multicounter automata I Potapov International Conference on Developments in Language Theory, 345-356, 2004 | 20 | 2004 |
| 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 | 19* | 2008 |
| Pushing lines helps: Efficient universal centralised transformations for programmable matter A Almethen, O Michail, I Potapov Theoretical Computer Science 830, 43-59, 2020 | 18 | 2020 |
Pavel SemukhinLiverpool John Moores UniversityVerified email at semukhin.name
