Distributed Computing

In this paper we investigate the computational power of a set of mobile robots with limited visibility. At each iteration, a robot takes a snapshot of its surroundings, uses the snapshot to compute a destination point, and it moves toward its ...${\mathbb{}}^{}$$\mathrm{}\mathrm{}$${\mathbb{}}^{}$

The unbeatability of a consensus protocol, introduced by Halpern et al. (SIAM J Comput 31:838–865, 2001), is a stronger notion of optimality than the accepted notion of early stopping protocols. Using a novel knowledge-based analysis, this paper ...

Commutative Replicated Data Types (CRDTs) are a promising new class of data structures for large-scale shared mutable content in applications that only require eventual consistency. The WithOut Operational Transforms (WOOT) framework is the first ...

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical ...$\mathsf{}\mathsf{}$$\mathsf{}$$\mathsf{}$$\mathsf{}$

We study here systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communication can also exploit network reconfiguration to carry out a given task. Also, ...${}_{}$${}_{}$${}_{}$${}_{}$$$$$$$$$$$$\mathrm{}$$$${}^{\mathrm{}}$