10 citations · 29 across the 25 of their papers we have counts for
15 papers · 1 filter
Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach
Matthew Connor, Othon Michail, Igor Potapov
We study a model of programmable matter systems consisting of devices lying on a 2-dimensional square grid which are able to perform the minimal mechanical operation of rotatin…
Gathering in 1-Interval Connected Graphs
Othon Michail, Paul G. Spirakis, Michail Theofilatos
We examine the problem of gathering agents (or multi-agent rendezvous) in dynamic graphs which may change in every synchronous round but remain always connected (-int…
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time
Matthew Connor, Othon Michail, Paul Spirakis
We study the class of networks which can be created in polylogarithmic parallel time by network constructors: groups of anonymous agents that interact randomly under a uniform rand…
Distributed Computation and Reconfiguration in Actively Dynamic Networks
Othon Michail, George Skretas, Paul G. Spirakis
In this paper, we study systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communicatio…
Fault Tolerant Network Constructors
Othon Michail, Paul G. Spirakis, Michail Theofilatos
In this work, we consider adversarial crash faults of nodes in the network constructors model Michail and Spirakis, 2016. We first show that, without further assumptions, the…
Fast Approximate Counting and Leader Election in Populations
Othon Michail, Paul G. Spirakis, Michail Theofilatos
We study the problems of leader election and population size counting for population protocols: networks of finite-state anonymous agents that interact randomly under a uniform ran…