default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor Potapov
Person information
- affiliation: University of Liverpool, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j46]Paul C. Bell
, Mika Hirvensalo, Igor Potapov:
The membership problem for subsemigroups of GL2(Z) is NP-complete. Inf. Comput. 296: 105132 (2024)- [j45]Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of Membership Problems for Flat Rational Subsets of \(\boldsymbol{{\textrm{GL}}(2,\boldsymbol{{\mathbb{Q}}})}\) and Singular Matrices. SIAM J. Comput. 53(6): 1663-1708 (2024) - [c62]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Collision-Free Robot Scheduling. ALGOWIN 2024: 1-15 - [c61]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. LATIN (2) 2024: 61-76 - [c60]Mika Hirvensalo, Akitoshi Kawamura, Igor Potapov, Takao Yuyama:
Reachability in Linear Recurrence Automata. RP 2024: 167-183 - [c59]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Brief Announcement: Collision-Free Robot Scheduling. SAND 2024: 22:1-22:5 - [i31]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Collision-Free Robot Scheduling. CoRR abs/2402.12019 (2024) - 2023
- [j44]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. Int. J. Found. Comput. Sci. 34(2&3): 163-182 (2023) - [j43]Vladimir V. Gusev, Duncan Adamson, Argyrios Deligkas, Dmytro Antypov, Christopher M. Collins, Piotr Krysta, Igor Potapov, George R. Darling, Matthew S. Dyer, Paul G. Spirakis, Matthew J. Rosseinsky:
Optimality guarantees for crystal structure prediction. Nat. 619(7968): 68-72 (2023) - [j42]Abdullah Almethen, Othon Michail, Igor Potapov:
Distributed transformations of Hamiltonian shapes based on line moves. Theor. Comput. Sci. 942: 142-168 (2023) - [c58]Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin:
On the Identity and Group Problems for Complex Heisenberg Matrices. RP 2023: 42-55 - [c57]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The k-Centre Problem for Classes of Cyclic Words. SOFSEM 2023: 385-400 - [e18]Olivier Bournez, Enrico Formenti, Igor Potapov:
Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings. Lecture Notes in Computer Science 14235, Springer 2023, ISBN 978-3-031-45285-7 [contents] - [i30]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
On the structural and combinatorial properties in 2-swap word permutation graphs. CoRR abs/2307.01648 (2023) - [i29]Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin:
On the Identity and Group Problems for Complex Heisenberg Matrices. CoRR abs/2307.05283 (2023) - [i28]Igor Potapov, Jason F. Ralph, Theofilos Triommatis:
The Maximum Cover with Rotating Field of View. CoRR abs/2309.15573 (2023) - 2022
- [j41]Paul C. Bell, Igor Potapov:
Towards Uniform Online Spherical Tessellations. Discret. Comput. Geom. 67(4): 1124-1146 (2022) - [j40]Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke:
Preface. Fundam. Informaticae 189(3-4) (2022) - [j39]Argyrios Deligkas, Igor Potapov:
Optimizing reachability sets in temporal graphs by delaying. Inf. Comput. 285(Part): 104890 (2022) - [j38]Abdullah Almethen, Othon Michail, Igor Potapov:
On efficient connectivity-preserving transformations in a grid. Theor. Comput. Sci. 898: 132-148 (2022) - [j37]Matthew Connor, Othon Michail, Igor Potapov:
Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. Theor. Comput. Sci. 936: 77-91 (2022) - [c56]Theofilos Triommatis, Igor Potapov, Gareth Rees, Jason F. Ralph:
A Geometric Approach to Passive Localisation. FUSION 2022: 1-8 - [c55]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The Complexity of Periodic Energy Minimisation. MFCS 2022: 8:1-8:15 - [e17]Anthony W. Lin, Georg Zetzsche, Igor Potapov:
Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings. Lecture Notes in Computer Science 13608, Springer 2022, ISBN 978-3-031-19134-3 [contents] - [i27]Theofilos Triommatis, Igor Potapov, Gareth Rees, Jason F. Ralph:
A Geometric Approach to Passive Localisation. CoRR abs/2207.13396 (2022) - 2021
- [j36]Matthew Hague, Igor Potapov:
Preface. Fundam. Informaticae 178(1-2) (2021) - [j35]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. Fundam. Informaticae 184(3): 181-203 (2021) - [j34]Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov:
Preface. Inf. Comput. 277: 104579 (2021) - [j33]Paul C. Bell, Igor Potapov, Pavel Semukhin:
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. Inf. Comput. 281: 104736 (2021) - [j32]Sang-Ki Ko, Reino Niskanen, Igor Potapov:
Reachability problems in low-dimensional nondeterministic polynomial maps over integers. Inf. Comput. 281: 104785 (2021) - [c54]Abdullah Almethen, Othon Michail, Igor Potapov:
Distributed Transformations of Hamiltonian Shapes Based on Line Moves. ALGOSENSORS 2021: 1-16 - [c53]Matthew Connor, Othon Michail, Igor Potapov:
Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. ALGOSENSORS 2021: 45-60 - [c52]Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas:
Ranking Bracelets in Polynomial Time. CPM 2021: 4:1-4:17 - [c51]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Integer Weighted Automata on Infinite Words. DLT 2021: 167-179 - [e16]Paul C. Bell, Patrick Totzke, Igor Potapov:
Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings. Lecture Notes in Computer Science 13035, Springer 2021, ISBN 978-3-030-89715-4 [contents] - [i26]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
Ranking Bracelets in Polynomial Time. CoRR abs/2104.04324 (2021) - [i25]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The k-Centre Selection Problem for Multidimensional Necklaces. CoRR abs/2108.01990 (2021) - [i24]Abdullah Almethen, Othon Michail, Igor Potapov:
Distributed Transformations of Hamiltonian Shapes based on Line Moves. CoRR abs/2108.08953 (2021) - [i23]Matthew Connor, Othon Michail, Igor Potapov:
Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. CoRR abs/2108.09250 (2021) - 2020
- [j31]Reino Niskanen, Igor Potapov, Julien Reichert:
On decidability and complexity of low-dimensional robot games. J. Comput. Syst. Sci. 107: 124-141 (2020) - [j30]Abdullah Almethen, Othon Michail, Igor Potapov:
Pushing lines helps: Efficient universal centralised transformations for programmable matter. Theor. Comput. Sci. 830-831: 43-59 (2020) - [c50]Argyrios Deligkas, Igor Potapov:
Optimizing Reachability Sets in Temporal Graphs by Delaying. AAAI 2020: 9810-9817 - [c49]Abdullah Almethen, Othon Michail, Igor Potapov:
On Efficient Connectivity-Preserving Transformations in a Grid. ALGOSENSORS 2020: 76-91 - [c48]Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. ISSAC 2020: 122-129 - [c47]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. SOFSEM 2020: 587-596 - [e15]Sylvain Schmitz, Igor Potapov:
Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings. Lecture Notes in Computer Science 12448, Springer 2020, ISBN 978-3-030-61738-7 [contents] - [i22]Argyrios Deligkas, Igor Potapov:
Optimizing Reachability Sets in Temporal Graphs by Delaying. CoRR abs/2004.05875 (2020) - [i21]Abdullah Almethen, Othon Michail, Igor Potapov:
On Efficient Connectivity-Preserving Transformations in a Grid. CoRR abs/2005.08351 (2020) - [i20]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The K-Centre Problem for Necklaces. CoRR abs/2005.10095 (2020)
2010 – 2019
- 2019
- [j29]Igor Potapov, Pavel Semukhin:
Vector and scalar reachability problems in SL(2, Z). J. Comput. Syst. Sci. 100: 30-43 (2019) - [c46]Abdullah Almethen, Othon Michail, Igor Potapov:
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. ALGOSENSORS 2019: 41-59 - [c45]Paul C. Bell, Igor Potapov:
Towards Uniform Online Spherical Tessellations. CiE 2019: 120-131 - [c44]Haomin Song, Igor Potapov:
Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences. DGCI 2019: 444-456 - [c43]Paul C. Bell, Igor Potapov, Pavel Semukhin:
On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. MFCS 2019: 83:1-83:15 - [e14]Emmanuel Filiot, Raphaël M. Jungers, Igor Potapov:
Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings. Lecture Notes in Computer Science 11674, Springer 2019, ISBN 978-3-030-30805-6 [contents] - [i19]Paul C. Bell, Igor Potapov, Pavel Semukhin:
Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. CoRR abs/1902.10188 (2019) - [i18]Abdullah Almethen, Othon Michail, Igor Potapov:
Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. CoRR abs/1904.12777 (2019) - [i17]Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. CoRR abs/1910.02302 (2019) - [i16]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. CoRR abs/1910.12026 (2019) - 2018
- [j28]Sang-Ki Ko, Igor Potapov:
Vector Ambiguity and Freeness Problems in SL(2, ℤ). Fundam. Informaticae 162(2-3): 161-182 (2018) - [j27]Igor Potapov, Pavel Semukhin:
Preface. Int. J. Found. Comput. Sci. 29(2): 139-142 (2018) - [j26]Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov:
Reachability Problems for One-Dimensional Piecewise Affine Maps. Int. J. Found. Comput. Sci. 29(4): 529-549 (2018) - [j25]Joël Ouaknine, Igor Potapov, James Worrell:
Reachability Problems 2014: Special issue. Theor. Comput. Sci. 735: 1 (2018) - [j24]Kim G. Larsen, Igor Potapov, Jirí Srba:
Reachability problems: Special issue. Theor. Comput. Sci. 750: 1 (2018) - [c42]Sang-Ki Ko, Reino Niskanen, Igor Potapov:
Reachability Problems in Nondeterministic Polynomial Maps on the Integers. DLT 2018: 465-477 - [c41]Sang-Ki Ko, Reino Niskanen, Igor Potapov:
On the Identity Problem for the Special Linear Group and the Heisenberg Group. ICALP 2018: 132:1-132:15 - [e13]Igor Potapov, Paul G. Spirakis, James Worrell:
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. LIPIcs 117, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-086-6 [contents] - [e12]Igor Potapov, Pierre-Alain Reynier:
Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings. Lecture Notes in Computer Science 11123, Springer 2018, ISBN 978-3-030-00249-7 [contents] - [i15]Paul C. Bell, Igor Potapov:
Towards Uniform Online Spherical Tessellations. CoRR abs/1810.01786 (2018) - [i14]Oleksiy Kurganskyy, Igor Potapov:
De Bruijn graphs and powers of 3/2. CoRR abs/1811.02254 (2018) - 2017
- [j23]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Weighted automata on infinite words in the context of Attacker-Defender games. Inf. Comput. 255: 27-44 (2017) - [c40]Igor Potapov, Pavel Semukhin:
Membership Problem in GL(2, Z) Extended by Singular Matrices. MFCS 2017: 44:1-44:13 - [c39]Igor Potapov, Pavel Semukhin:
Decidability of the Membership Problem for 2 × 2 integer matrices. SODA 2017: 170-186 - [c38]Paul C. Bell, Mika Hirvensalo, Igor Potapov:
The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete. SODA 2017: 187-206 - [c37]Sang-Ki Ko, Igor Potapov:
Matrix Semigroup Freeness Problems in SL (2, \mathbb Z). SOFSEM 2017: 268-279 - [c36]Sang-Ki Ko, Igor Potapov:
Vector Ambiguity and Freeness Problems in SL (2, ℤ). TAMC 2017: 373-388 - [e11]Matthew Hague, Igor Potapov:
Reachability Problems - 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings. Lecture Notes in Computer Science 10506, Springer 2017, ISBN 978-3-319-67088-1 [contents] - [i13]Sang-Ki Ko, Reino Niskanen, Igor Potapov:
On the Identity Problem for the Special Linear Group and the Heisenberg Group. CoRR abs/1706.04166 (2017) - [i12]Sang-Ki Ko, Igor Potapov:
Composition problems for braids: Membership, Identity and Freeness. CoRR abs/1707.08389 (2017) - 2016
- [j22]Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov:
Preface. Fundam. Informaticae 143(3-4): i-ii (2016) - [c35]Reino Niskanen, Igor Potapov, Julien Reichert:
Undecidability of Two-dimensional Robot Games. MFCS 2016: 73:1-73:13 - [c34]Igor Potapov, Pavel Semukhin:
Vector Reachability Problem in SL(2, Z). MFCS 2016: 84:1-84:14 - [c33]Igor Potapov:
Pattern formations with broadcasting automata model. NCMA 2016: 61-73 - [c32]Igor Potapov, Olena Prianychnykova, Sergey Verlan:
Insertion-Deletion Systems over Relational Words. RP 2016: 177-191 - [c31]Oleksiy Kurganskyy, Igor Potapov:
Reachability Problems for PAMs. SOFSEM 2016: 356-368 - [e10]Kim Guldstrand Larsen, Igor Potapov, Jirí Srba:
Reachability Problems - 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings. Lecture Notes in Computer Science 9899, Springer 2016, ISBN 978-3-319-45993-6 [contents] - [i11]Igor Potapov, Pavel Semukhin:
Decidability of the Membership Problem for 2×2 integer matrices. CoRR abs/1604.02303 (2016) - [i10]Reino Niskanen, Igor Potapov, Julien Reichert:
Undecidability of Two-dimensional Robot Games. CoRR abs/1604.08779 (2016) - [i9]Sang-Ki Ko, Igor Potapov:
Matrix Semigroup Freeness Problems in SL(2,Z). CoRR abs/1610.09834 (2016) - 2015
- [c30]Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov:
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games. CiE 2015: 206-215 - [c29]Vesa Halava, Reino Niskanen, Igor Potapov:
On Robot Games of Degree Two. LATA 2015: 224-236 - [e9]Igor Potapov:
Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Lecture Notes in Computer Science 9168, Springer 2015, ISBN 978-3-319-21499-3 [contents] - [e8]Mikolaj Bojanczyk, Slawomir Lasota, Igor Potapov:
Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings. Lecture Notes in Computer Science 9328, Springer 2015, ISBN 978-3-319-24536-2 [contents] - [i8]Igor Potapov, Pavel Semukhin:
Vector Reachability Problem in SL(2, Z). CoRR abs/1510.03227 (2015) - [i7]Igor Potapov, Olena Prianychnykova, Sergey Verlan:
On insertion-deletion systems over relational words. CoRR abs/1510.03231 (2015) - [i6]Oleksiy Kurganskyy, Igor Potapov:
Reachability problems for PAMs. CoRR abs/1510.04121 (2015) - 2014
- [e7]Joël Ouaknine, Igor Potapov, James Worrell:
Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. Lecture Notes in Computer Science 8762, Springer 2014, ISBN 978-3-319-11438-5 [contents] - [i5]Thomas Nickson, Igor Potapov:
Broadcasting Automata and Patterns on Z^2. CoRR abs/1410.0573 (2014) - [i4]Vesa Halava, Reino Niskanen, Igor Potapov:
On Undecidability of Counter Reachability Games in Dimension One. CoRR abs/1411.4796 (2014) - 2013
- [j21]Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider:
Preface. Fundam. Informaticae 123(1) (2013) - [j20]Giorgio Delzanno, Igor Potapov:
Preface. Int. J. Found. Comput. Sci. 24(2): 161-164 (2013) - [c28]Igor Potapov:
Composition Problems for Braids. FSTTCS 2013: 175-187 - [e6]Parosh Aziz Abdulla, Igor Potapov:
Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings. Lecture Notes in Computer Science 8169, Springer 2013, ISBN 978-3-642-41035-2 [contents] - 2012
- [j19]Paul C. Bell, Igor Potapov:
On the Computational Complexity of Matrix Semigroup Problems. Fundam. Informaticae 116(1-4): 1-13 (2012) - [j18]Russell Martin, Thomas Nickson, Igor Potapov:
Geometric computations by broadcasting automata. Nat. Comput. 11(4): 623-635 (2012) - [j17]Igor Grunsky, Igor Potapov, Elena Pryanichnikova:
On algebra of languages representable by vertex-labeled graphs. Theor. Comput. Sci. 426: 42-48 (2012) - [c27]Paul C. Bell, Mika Hirvensalo, Igor Potapov:
Mortality for 2×2 Matrices Is NP-Hard. MFCS 2012: 148-159 - [c26]Thomas Nickson, Igor Potapov:
Discrete Discs and Broadcasting Sequences. UCNC 2012: 235 - [e5]Alain Finkel, Jérôme Leroux, Igor Potapov:
Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings. Lecture Notes in Computer Science 7550, Springer 2012, ISBN 978-3-642-33511-2 [contents] - 2011
- [j16]Olivier Bournez, Igor Potapov:
Preface. Int. J. Found. Comput. Sci. 22(4) (2011) - [c25]Alexei Lisitsa, Igor Potapov, Rafiq Saleh:
Planarity of Knots, Register Automata and LogSpace Computability. LATA 2011: 366-377 - [c24]Russell Martin, Thomas Nickson, Igor Potapov:
Geometric Computations by Broadcasting Automata on the Integer Grid. UC 2011: 138-151 - [e4]Giorgio Delzanno, Igor Potapov:
Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings. Lecture Notes in Computer Science 6945, Springer 2011, ISBN 978-3-642-24287-8 [contents] - 2010
- [j15]Paul C. Bell, Igor Potapov:
On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups. Int. J. Found. Comput. Sci. 21(6): 963-978 (2010) - [j14]Oscar H. Ibarra, Igor Potapov, Hsu-Chun Yen:
On decision problems for parameterized machines. Theor. Comput. Sci. 411(7-9): 1192-1201 (2010) - [e3]Antonín Kucera, Igor Potapov:
Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings. Lecture Notes in Computer Science 6227, Springer 2010, ISBN 978-3-642-15348-8 [contents] - [i3]Oleksiy Kurganskyy, Igor Potapov:
A measure of state transition of collective of stateless automata in discrete environment. CoRR abs/1007.2353 (2010)
2000 – 2009
- 2009
- [j13]Alexei Lisitsa, Igor Potapov:
On the Computational Power of Querying the History. Fundam. Informaticae 91(2): 395-409 (2009) - [j12]Vesa Halava, Igor Potapov:
Preface. Int. J. Found. Comput. Sci. 20(5): 775-777 (2009) - [c23]Paul Bell, Igor Potapov:
The Identity Correspondence Problem and Its Applications. ISAAC 2009: 657-667 - [c22]Alexei Lisitsa, Igor Potapov, Rafiq Saleh:
Automata on Gauss Words. LATA 2009: 505-517 - [e2]Olivier Bournez, Igor Potapov:
Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings. Lecture Notes in Computer Science 5797, Springer 2009, ISBN 978-3-642-04419-9 [contents] - [i2]Vitaliy Kurlin, Alexei Lisitsa, Igor Potapov, Rafiq Saleh:
On Descriptional Complexity of the Planarity Problem for Gauss Words. CoRR abs/0907.4180 (2009) - 2008
- [j11]Paul Bell, Igor Potapov:
Reachability problems in quaternion matrix and rotation semigroups. Inf. Comput. 206(11): 1353-1361 (2008) - [j10]Paul Bell, Vesa Halava, Tero Harju, Juhani Karhumäki, Igor Potapov:
Matrix Equations and Hilbert's Tenth Problem. Int. J. Algebra Comput. 18(8): 1231-1241 (2008) - [j9]Vesa Halava, Igor Potapov:
Preface. Int. J. Found. Comput. Sci. 19(4): 915-917 (2008) - [j8]Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-Caparrini:
Reachability Problems in Low-Dimensional Iterative Maps. Int. J. Found. Comput. Sci. 19(4): 935-951 (2008) - [j7]Paul Bell, Igor Potapov:
On undecidability bounds for matrix decision problems. Theor. Comput. Sci. 391(1-2): 3-13 (2008) - [c21]Paul Bell, Igor Potapov:
Periodic and Infinite Traces in Matrix Semigroups. SOFSEM 2008: 148-161 - [c20]Vesa Halava, Igor Potapov:
Preface. RP 2008: 1-2 - [e1]Vesa Halava, Igor Potapov:
Proceedings of the Second Workshop on Reachability Problems in Computational Models, RP 2008, Liverpool, UK, September 15-17, 2008. Electronic Notes in Theoretical Computer Science 223, Elsevier 2008 [contents] - 2007
- [j6]Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik:
Deterministic Communication in Radio Networks with Large Labels. Algorithmica 47(1): 97-117 (2007) - [j5]Paul Bell, Igor Potapov:
On the membership of invertible diagonal and scalar matrices. Theor. Comput. Sci. 372(1): 37-45 (2007) - [j4]Leszek Gasieniec, Igor Potapov, Qin Xin:
Time efficient centralized gossiping in radio networks. Theor. Comput. Sci. 383(1): 45-58 (2007) - [c19]Oleksiy Kurganskyy, Igor Potapov, Fernando Sancho-Caparrini:
Computation in One-Dimensional Piecewise Maps. HSCC 2007: 706-709 - [c18]Paul Bell, Igor Potapov:
Reachability Problems in Quaternion Matrix and Rotation Semigroups. MFCS 2007: 346-358 - 2006
- [c17]Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov:
On a Maximal NFA Without Mergible States. CSR 2006: 202-210 - [c16]Paul Bell, Igor Potapov:
Lowering Undecidability Bounds for Decision Questions in Matrices. Developments in Language Theory 2006: 375-385 - [c15]Alexei Lisitsa, Igor Potapov:
In time alone: on the computational power of querying the history. TIME 2006: 42-49 - 2005
- [j3]Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov:
Space efficient search for maximal repetitions. Theor. Comput. Sci. 339(1): 35-48 (2005) - [c14]Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov, Paul Sant:
Real-Time Traversal in Grammar-Based Compressed Files. DCC 2005: 458 - [c13]Paul Bell, Igor Potapov:
On the Membership of Invertible Diagonal Matrices. Developments in Language Theory 2005: 146-157 - [c12]Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov:
Languages Representable by Vertex-Labeled Graphs. MFCS 2005: 435-446 - [c11]Alexei Lisitsa, Igor Potapov:
Temporal Logic with Predicate lambda-Abstraction. TIME 2005: 147-155 - [c10]Oleksiy Kurganskyy, Igor Potapov:
Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems. UC 2005: 169-175 - 2004
- [c9]Oleksiy Kurganskyy, Igor Potapov:
On the Computation Power of Finite Automata in Two-dimensional Environments. Developments in Language Theory 2004: 261-271 - [c8]Igor Potapov:
From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. Developments in Language Theory 2004: 345-356 - [c7]Alexei Lisitsa, Igor Potapov:
Membership and Reachability Problems for Row-Monomial Transformations. MFCS 2004: 623-634 - [c6]Leszek Gasieniec, Igor Potapov, Qin Xin:
Time Efficient Gossiping in Known Radio Networks. SIROCCO 2004: 173-184 - [i1]Alexei Lisitsa, Igor Potapov:
Temporal logic with predicate abstraction. CoRR cs.LO/0410072 (2004) - 2003
- [j2]Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46(4): 391-400 (2003) - [j1]Leszek Gasieniec, Igor Potapov:
Time/Space Efficient Compressed Pattern Matching. Fundam. Informaticae 56(1-2): 137-154 (2003) - 2002
- [c5]Leszek Gasieniec, Aris Pagourtzis, Igor Potapov:
Deterministic Communication in Radio Networks with Large Labels. ESA 2002: 512-524 - [c4]Leszek Gasieniec, Igor Potapov:
Gossiping with Unit Messages in Known Radio Networks. IFIP TCS 2002: 193-205 - [c3]Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI 2002: 217-225 - 2001
- [c2]Leszek Gasieniec, Igor Potapov:
Time/Space Efficient Compressed Pattern Matching. FCT 2001: 138-149 - [c1]Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI 2001: 249-256
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-26 23:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
