Sensors have limited precision and accuracy. They extract data from the physical
environment, which contains noise. The goal of sensor fusion is to make the final decision …

We study the problem of solving consensus in synchronous directed dynamic networks, in
which communication is controlled by an oblivious message adversary that picks the …

Fault-tolerant consensus has been studied extensively in the literature, because it is one of
the important distributed primitives and has wide applications in practice. This paper surveys …

More than two decades ago, combinatorial topology was shown to be useful for analyzing
distributed fault-tolerant algorithms in shared memory systems and in message passing …

In this paper, we address the Approximate Agreement problem in the Mobile Byzantine Fault
model. Our contribution is three-fold. First, we refine the problem specification to adapt it to …

Agreeing on a common value among a set of agents is a fundamental problem in distributed
computing, which occurs in several variants: In contrast to exact consensus, approximate …

Data dissemination is a fundamental task in distributed computing. This paper studies
broadcast problems in various innovative models where the communication network …

This paper identifies necessary and sufficient conditions for the existence of iterative
algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs …

We consider the problem of solving consensus using deterministic algorithms in a
synchronous dynamic network with unreliable, directional point-to-point links, which are …

A set of mutually distrusting participants that want to agree on a common opinion must solve
an instance of a Byzantine agreement problem. These problems have been extensively …