Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
This paper considers the basic $${\mathcal {PULL}}$$PULL model of communication, in which in each round, each agent extracts information from few randomly chosen agents. We seek to identify the smallest amount of information revealed in each interaction ...
Chemical foundations of distributed aspects
Distributed applications are challenging to program because they have to deal with a plethora of concerns, including synchronization, locality, replication, security and fault tolerance. Aspect-oriented programming (AOP) is a paradigm that promotes ...
Randomized proof-labeling schemes
Proof-labeling schemes, introduced by Korman et al. (Distrib Comput 22(4):215---233, 2010. https://doi.org/10.1007/s00446-010-0095-3), are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find ...
The topology of look-compute-move robot wait-free algorithms with hard termination
Look-Compute-Move models for a set of autonomous robots have been thoroughly studied for over two decades. We consider the standard Asynchronous Luminous Robots (ALR) model, where robots are located in a graph G. Each robot, repeatedly Looks at its ...
