Browse by People

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

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2021) Beyond Rings: Gathering in 1-Interval Connected Graphs. PARALLEL PROCESSING LETTERS, 31 (04).

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Brief Announcement: Fast Approximate Counting and Leader Election in Populations. .

Michail, Othon ORCID: 0000-0002-6234-3960, Chatzigiannakis, Ioannis and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2014) Causality, influence, and computation in possibly disconnected synchronous dynamic networks. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 74 (01). pp. 2016-2026.

Connor, Matthew and Michail, Othon ORCID: 0000-0002-6234-3960 (2022) Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for All Orthogonal Convex Shapes. In: International Symposium on Algorithmics of Wireless Networks (ALGOSENSORS).

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.

Spirakis, PG ORCID: 0000-0001-5396-3749 and Michail, Othon ORCID: 0000-0002-6234-3960 (2018) Communications of ACM (CACM). Communications of the ACM.

Mertzios, George B, Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail (2022) The Complexity of Growing a Graph. In: International Symposium on Algorithmics of Wireless Networks (ALGOSENSORS).

Mertzios, George B, Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George ORCID: 0000-0003-2514-8004, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2021) The Complexity of Growing a Graph. [Preprint]

Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) Connectivity Preserving Network Transformers. In: Emergent Computation.

Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) Connectivity preserving network transformers. THEORETICAL COMPUTER SCIENCE, 671. pp. 36-55.

Skretas, Georgios ORCID: 0000-0003-2514-8004 (2022) Construction, Reconfiguration and Computation in Actively Dynamic Networks. PhD thesis, University of Liverpool.

Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, george ORCID: 0000-0003-2514-8004 and Spirakis, paul ORCID: 0000-0001-5396-3749 (2020) Distributed Computation and Reconfiguration in Actively Dynamic Networks. In: 39th ACM Symposium on Principles of Distributed Computing (PODC), 2020-8-3 - 2020-8-7.

Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, Georgios ORCID: 0000-0003-2514-8004 and Spirakis, paul ORCID: 0000-0001-5396-3749 (2022) Distributed Computation and Reconfiguration in Actively Dynamic Networks. Distributed Computing, 35 (2). pp. 185-206.

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

Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George ORCID: 0000-0003-2514-8004 and Spirakis, Paul G (2022) Distributed computation and reconfiguration in actively dynamic networks. DISTRIBUTED COMPUTING, 35 (2). 185 - 206.

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.

Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2018) Elements of the Theory of Dynamic Networks. COMMUNICATIONS OF THE ACM, 61 (2). pp. 72-81.

Doty, David, Eftekhari, Mahsa, Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Exact size counting in uniform population protocols in nearly logarithmic time. CoRR, abs/18.

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Fast Approximate Counting and Leader Election in Populations. In: 25th International Colloquium on Structural Information and Communication Complexity (SIROCCO ) 2018, 2018-6-18 - 2018-6-21, Maale HaHawisha Israel.

Adamson, D ORCID: 0000-0003-3343-2435, Gusev, VV, Malyshev, D and Zamaraev, V ORCID: 0000-0001-5755-4141 (2022) Faster Exploration of Some Temporal Graphs. .

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2019) Fault Tolerant Network Constructors. Lecture Notes in Computer Science, 11914. pp. 243-255.

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2023) Fault tolerant network constructors. In: International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS).

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail (2023) Fault tolerant network constructors. Information and Computation, 292. p. 105037.

Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2018) How many cooks spoil the soup? DISTRIBUTED COMPUTING, 31 (6). pp. 455-469.

Michail, Othon ORCID: 0000-0002-6234-3960 (2016) AN INTRODUCTION TO TEMPORAL GRAPHS: AN ALGORITHMIC PERSPECTIVE. INTERNET MATHEMATICS, 12 (4). pp. 239-280.

Michail, Othon ORCID: 0000-0002-6234-3960, Chatzigiannakis, Ioannis and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2011) Mediated population protocols. THEORETICAL COMPUTER SCIENCE, 412 (22). pp. 2434-2450.

Amaxilatis, Dimitrios, Logaras, Marios, Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2015) NETCS: A New Simulator of Population Protocols and Network Constructors.

Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) Network Constructors: A Model for Programmable Matter. In: 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2017-1-16 - 2017-1-20, Lero-Limerick, Ireland.

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.

Almalki, Nada and Michail, Othon ORCID: 0000-0002-6234-3960 (2022) On Geometric Shape Construction via Growth Operations. In: International Symposium on Algorithmics of Wireless Networks (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.

Almalki, Nada ORCID: 0000-0001-9403-1702 and Michail, Othon ORCID: 0000-0002-6234-3960 (2024) On geometric shape construction via growth operations. Theoretical Computer Science, 984. p. 114324.

Connor, Matthew, Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul ORCID: 0000-0001-5396-3749 (2021) On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time. Information, 12 (6). p. 254.

Michail, Othon ORCID: 0000-0002-6234-3960, Skretas, George ORCID: 0000-0003-2514-8004 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2017) On the Transformation Capability of Feasible Mechanisms for Programmable Matter. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017-7-10 - 2017-7-14.

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.

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, PG ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2018) Simple and Fast Approximate Counting and Leader Election in Populations. In: 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018-11-4 - 2018-11-7, Tokyo, Japan..

Michail, Othon ORCID: 0000-0002-6234-3960, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2022) Simple and fast approximate counting and leader election in populations. INFORMATION AND COMPUTATION, 285. p. 104698.

Theofilatos, Michail ORCID: 0000-0002-3699-0179 (2021) Stability and Structure-Formation Problems for Dynamic and Chemical Systems. PhD thesis, University of Liverpool.

Mertzios, George, Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul ORCID: 0000-0001-5396-3749 (2019) Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica: an international journal in computer science, 81 (4). pp. 1416-1449.

Michail, Othon ORCID: 0000-0002-6234-3960 (2015) Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata. In: PODC '15: ACM Symposium on Principles of Distributed Computing, 2015-7-21 - 2015-7-23, Donostia-San Sebastián, Spain.

Michail, Othon ORCID: 0000-0002-6234-3960 and Spirakis, Paul G ORCID: 0000-0001-5396-3749 (2015) Terminating population protocols via some minimal global knowledge assumptions. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 81-82. pp. 1-10.