In the stochastic population protocol model, we are given a connected gr...
We show that any algorithm that solves the sinkless orientation problem ...
Approximate agreement is one of the few variants of consensus that can b...
In this work, we consider distributed agreement tasks in microbial
distr...
Online algorithms make decisions based on past inputs. In general, the
d...
Let G be a graph on n nodes. In the stochastic population protocol model...
In this work we introduce the graph-theoretic notion of mendability: for...
We introduce a new graph problem, the token dropping game, and we show h...
Consider a distributed system, where the topology of the communication
n...
Consider a distributed system with n processors out of which f can be
By...
This paper investigates the power of preprocessing in the CONGEST model....