Browse by People


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


Connor, Matthew
(2023) Algorithmic Transformations and Constructions for Programmable Matter and other Networked Systems. PhD thesis, University of Liverpool.


Adamson, Duncan
(2021) Algorithmic and Combinatorial Problems in Crystal Structure Prediction. PhD thesis, University of Liverpool.


Avni, Guy, Henzinger, Thomas A, Ibsen-Jensen, Rasmus ORCID: 0000-0003-4783-0389 and Novotný, Petr
(2019) Bidding Games on Markov Decision Processes. .


Nickson, Thomas and Potapov, Igor
(2014) Broadcasting Automata and Patterns on Z^2. In: Automata, Universality, Computation. Springer. ISBN 978-3-319-09039-9


Connor, Matthew, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2021) Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach. ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2021, 12961. pp. 45-60.


Almethen, Abdullah
(2021) Centralised and Distributed Shape Formation with a Linear-Strength Model. Doctor of Philosophy thesis, University of Liverpool.


Connor, Matthew, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2022) Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. In: ALGOSENSORS, 2021-9-9 - 2021-9-10.


Connor, Matthew, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2022) Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. Theoretical Computer Science, 936. pp. 77-91.


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2021) Combinatorial Algorithms for Multidimensional Necklaces. [Preprint]


Ko, Sang-Ki and Potapov, Igor
(2017) Composition problems for braids: Membership, Identity and Freeness. [Internet Publication]


Kurganskyy, Oleksiy and Potapov, Igor
(2018) De Bruijn graphs and powers of $3/2$. [Internet Publication]


Diekert, Volker, Potapov, Igor and Semukhin, Pavel
(2019) Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices. In: ISSAC '20: International Symposium on Symbolic and Algebraic Computation.


Potapov, Igor and Semukhin, Pavel
(2016) Decidability of the Membership Problem for $2\times 2$ integer matrices. [Preprint]


Potapov, Igor and Semukhin, Pavel
(2017) Decidability of the Membership Problem for 2 × 2 integer matrices. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms.


Bell, Paul C, Potapov, Igor and Semukhin, Pavel
(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-8-26 - 2019-8-30, Aachen, Germany.


Potapov, Igor and Semukhin, Pavel
(2017) Decidability of the membership problem for 2 × 2 integer matrices. In: ACM-SIAM Symposium on Discrete Algorithms, 2017-1-16 - 2017-1-19, Barcelona, Spain.


Deligkas, Argyrios and Meir, Reshef
(2017) Directed Graph Minors and Serial-Parallel Width. .


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2021) Distributed Transformations of Hamiltonian Shapes Based on Line Moves. .


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2023) Distributed transformations of Hamiltonian shapes based on line moves. In: ALGOSENSORS, 2021-9-9 - 2021-9-10.


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2023) Distributed transformations of Hamiltonian shapes based on line moves. Theor. Comput. Sci., 942. pp. 142-168.


Triommatis, Theofilos, Potapov, Igor, Rees, Gareth and Ralph, Jason F
(2022) A Geometric Approach to Passive Localisation. CoRR, abs/22.


Smith, Philip
(2021) Geometric and Topological Methods for Applications to Materials and Data Skeletonisation. PhD thesis, University of Liverpool.


Filos-Ratsikas, Aris ORCID: 0000-0001-7868-8114, Frederiksen, Soren Kristoffer Stiil, Goldberg, Paul W and Zhang, Jie
(2016) Hardness Results for Consensus-Halving. .


Bose, Sougata, Henzinger, Thomas A, Lehtinen, Karoliina, Schewe, Sven ORCID: 0000-0002-9093-9518 and Totzke, Patrick ORCID: 0000-0001-5274-8190
(2022) History-Deterministic Timed Automata Are Not Determinizable. .


Bell, Paul C and Potapov, Igor
(2009) The Identity Correspondence Problem and its Applications. World Scientific, 21. 6-.


Halava, Vesa, Harju, Tero, Niskanen, Reino and Potapov, Igor
(2023) Integer Weighted Automata on Infinite Words. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 34 (02N03). pp. 163-182.


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2020) The K-Centre Problem for Necklaces. [Internet Publication]


Ko, Sang-Ki and Potapov, Igor
(2016) Matrix Semigroup Freeness Problems in $\mathrm{SL}(2,\mathbb{Z})$. .


Ko, Sang-Ki and Potapov, Igor
(2017) Matrix Semigroup Freeness Problems in SL(2, Z). In: 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM2017), 2017-1-16 - 2017-1-20, Lero – Limerick, Ireland.


Potapov, Igor, Ralph, Jason F ORCID: 0000-0002-4946-9948 and Triommatis, Theofilos
(2023) The Maximum Cover with Rotating Field of View. CoRR, abs/23.


Livesey, Joseph and Wojtczak, Dominik ORCID: 0000-0001-5560-0546
(2021) Minimal Number of Calls in Propositional Protocols. .


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2020) On Efficient Connectivity-Preserving Transformations in a Grid. ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2020, 12503. pp. 76-91.


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2020) On Efficient Connectivity-Preserving Transformations in a Grid. In: ALGOSENSORS.


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2022) On efficient connectivity-preserving transformations in a grid. THEORETICAL COMPUTER SCIENCE, 898. pp. 132-148.


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2020) On the Hardness of Energy Minimisation for Crystal Structure Prediction. [Internet Publication]


Adamson, Duncan ORCID: 0000-0003-3343-2435, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2021) On the Hardness of Energy Minimisation for Crystal Structure Prediction. FUNDAMENTA INFORMATICAE, 184 (3). pp. 181-203.


Ko, Sang-Ki, Niskanen, Reino ORCID: 0000-0002-2210-1481 and Potapov, Igor
(2017) On the Identity Problem for the Special Linear Group and the Heisenberg Group. [Internet Publication]


Ko, Sang-Ki, Niskanen, Reino and Potapov, Igor
(2018) On the Identity Problem for the Special Linear Group and the Heisenberg Group. In: International Colloquium on Automata, Languages, and Programming (ICALP), 2018-7-9 - 2018-7-13, Prague, Czech Republic.


Bell, Paul C, Niskanen, Reino, Potapov, Igor and Semukhin, Pavel
(2023) On the Identity and Group Problems for Complex Heisenberg Matrices. CoRR, abs/23.


Bell, Paul C, Potapov, Igor and Semukhin, Pavel
(2019) On the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. [Internet Publication]


Bell, Paul C, Potapov, Igor and Semukhin, Pavel
(2021) On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. Information and Computation, 281. p. 104736.


Adamson, Duncan ORCID: 0000-0003-3343-2435, Flaherty, Nathan, Potapov, Igor and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2023) On the structural and combinatorial properties in 2-swap word permutation graphs. [Preprint]


Adamson, Duncan, Flaherty, Nathan, Potapov, Igor and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2023) On the structural and combinatorial properties in 2-swap word permutation graphs. CoRR, abs/23.


Bell, Paul C, Niskanen, Reino, Potapov, Igor and Semukhin, Pavel
(2023) On the Identity and Group Problems for Complex Heisenberg Matrices. .


Adamson, Duncan ORCID: 0000-0003-3343-2435, Gusev, Vladimir V, Deligkas, Argyrios, Antypov, Dmytro ORCID: 0000-0003-1893-7785, Collins, Chritopher M ORCID: 0000-0002-0101-4426, Krysta, Piotr, Potapov, Igor, Darling, George R ORCID: 0000-0001-9329-9993, Dyer, Matthew S ORCID: 0000-0002-4923-3003, Spirakis, Paul ORCID: 0000-0001-5396-3749
et al (show 1 more authors) (2023) Optimality Guarantees for Crystal Structure Prediction. Nature, 619 (7968). 68-+.


Deligkas, Argyrios and Potapov, Igor
(2020) Optimizing Reachability Sets in Temporal Graphs by Delaying. [Internet Publication]


Deligkas, Argyrios and Potapov, Igor
(2022) Optimizing reachability sets in temporal graphs by delaying. Information and Computation, 285. p. 104890.


Deligkas, Argyrios and Potapov, Igor
(2022) Optimizing reachability sets in temporal graphs by delaying. INFORMATION AND COMPUTATION, 285. pp. 9810-9817.


Hague, M ORCID: 0000-0003-4913-3800, Meyer, R, Muskalla, S ORCID: 0000-0001-9195-7323 and Zimmermann, M ORCID: 0000-0002-8038-2453
(2018) Parity to safety in polynomial time for pushdown and collapsible pushdown systems. .


Nickson, Thomas
Pattern formations with discrete waves and broadcasting sequences. Doctor of Philosophy thesis, University of Liverpool.


Song, Haomin and Potapov, Igor
(2019) Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences. In: 21st IAPR International Conference on Discrete Geometry for Computer Imagery,, 2019-3-24 - 2019-3-29, Paris, France.


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2019) Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter. [Internet Publication]


Almethen, Abdullah, Michail, Othon ORCID: 0000-0002-6234-3960 and Potapov, Igor
(2020) Pushing lines helps: Efficient universal centralised transformations for programmable matter. Theor. Comput. Sci., 830-83. pp. 43-59.


Adamson, Duncan, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2021) Ranking Bracelets in Polynomial Time. In: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021).


Kurganskyy, Oleksiy and Potapov, Igor
(2016) Reachability Problems for PAMs. .


Ko, Sang-Ki, Niskanen, Reino ORCID: 0000-0002-2210-1481 and Potapov, Igor
(2018) Reachability Problems in Nondeterministic Polynomial Maps on the Integers. In: 22nd International Conference on Developments in Language Theory (DLT 2018), 2018-9-10 - 2018-9-14, Tokyo, Japan.


Niskanen, R ORCID: 0000-0002-2210-1481
(2018) Reachability games and related matrix and word problems. Doctor of Philosophy thesis, University of Liverpool.


Ditmarsch, Hans van, Gattinger, Malvin, Kokkinis, Ioannis and Kuijer, Louwe B ORCID: 0000-0001-6696-9023
(2019) Reachability of Five Gossip Protocols. In: 13th International Conference on Reachability Problems (RP19).


Zamaraeva, Elena, Collins, Christopher M ORCID: 0000-0002-0101-4426, Antypov, Dmytro ORCID: 0000-0003-1893-7785, Gusev, Vladimir V, Savani, Rahul ORCID: 0000-0003-1262-7831, Dyer, Matthew Stephen ORCID: 0000-0002-4923-3003, Darling, George ORCID: 0000-0001-9329-9993, Potapov, Igor, Rosseinsky, Matthew J ORCID: 0000-0002-1910-2483 and Spirakis, Paul G ORCID: 0000-0001-5396-3749
(2023) Reinforcement Learning in Crystal Structure Prediction. Digital Discovery, 2 (6). pp. 1831-1840.


Lisitsa, A
(2018) Revisiting mu-puzzle. A case study in finite countermodels verification. .


Krebs, A, Meier, A ORCID: 0000-0002-8061-5376, Virtema, J ORCID: 0000-0002-1582-3718 and Zimmermann, M ORCID: 0000-0002-8038-2453
(2018) Team semantics for the specification and verification of hyperproperties. .


Bell, Paul C and Potapov, Igor
(2022) Towards Uniform Online Spherical Tessellations. .


Bell, Paul C and Potapov, Igor
(2019) Towards Uniform Online Spherical Tessellations. In: 15th Conference on Computability in Europe, CiE 2019, 2019-7-15 - 2019-7-19, Durham, UK.


Bell, Paul C and Potapov, Igor
(2022) Towards Uniform Online Spherical Tessellations. Discret. Comput. Geom., 67. pp. 1124-1146.


Niskanen, Reino ORCID: 0000-0002-2210-1481, Potapov, Igor and Reichert, Julien
(2016) Undecidability of Two-dimensional Robot Games. Leibniz International Proceedings in Informatics, LIPIcs, 58.


Ko, Sang-Ki and Potapov, Igor
(2018) Vector Ambiguity and Freeness Problems in SL(2, Z). FUNDAMENTA INFORMATICAE, 162 (2-3). pp. 161-182.


Potapov, Igor and Semukhin, Pavel
(2015) Vector Reachability Problem in $\mathrm{SL}(2,\mathbb{Z})$. [Internet Publication]


Adamson, Duncan ORCID: 0000-0003-3343-2435, Deligkas, Argyrios, Gusev, Vladimir V and Potapov, Igor
(2023) The k-Centre Problem for Classes of Cyclic Words. .

This list was generated on Sun Jan 21 15:59:43 2024 GMT.