activity
20102023
most citedPassively Mobile Communicating Logarithmic Space Machines

10 citations · 29 across the 25 of their papers we have counts for

collaborators
Showing 2015Show all

5 papers · 1 filter

cs.DC2015

Connectivity Preserving Network Transformers

Othon Michail, Paul G. Spirakis

The Population Protocol model is a distributed model that concerns systems of very weak computational entities that cannot control the way they interact. The model of Network Const…

cs.DC2015★ 3 cited

NETCS: A New Simulator of Population Protocols and Network Constructors

Dimitrios Amaxilatis, Marios Logaras, Othon Michail +1

Network Constructors are an extension of the standard population protocol model in which finite-state agents interact in pairs under the control of an adversary scheduler. In this…

cs.DC2015★ 1 cited

Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata

Othon Michail

We consider a solution of automata similar to Population Protocols and Network Constructors. The automata (or nodes) move passively in a well-mixed solution and can cooperate by in…

cs.DM2015★ 3 cited

An Introduction to Temporal Graphs: An Algorithmic Perspective

Othon Michail

A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and…

cs.DM2015★ 2 cited

Temporal Network Optimization Subject to Connectivity Constraints

George B. Mertzios, Othon Michail, Paul G. Spirakis

In this work we consider \emph{temporal networks}, i.e. networks defined by a \emph{labeling} assigning to each edge of an \emph{underlying graph} a set of \emph{discrete}…