Consensus is a classical distributed systems problem with both theoretical and practical
interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the …

Distributed Computing Through Combinatorial Topology describes techniques for analyzing
distributed algorithms based on award winning combinatorial topology research. The …

This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …

This paper addresses the problem of distributed multi-agent optimization in which each
agent i has a local cost function hi (x), and the goal is to optimize a global cost function that …

This paper presents a new round-based asynchronous consensus algorithm that copes with
up to t< n/3 Byzantine processes, where n is the total number of processes. In addition of not …

The production of J/Ψ mesons in central collisions of heavy nuclei is investigated as a
function of collision energy. Two contributions are considered simultaneously: early (hard) …

This article is on broadcast and agreement in asynchronous message-passing systems
made up of n processes, and where up to t processes may have a Byzantine Behavior. Its …

This paper proposes a stack of three Byzantine-resistant protocols aimed to be used in
practical distributed systems: multi-valued consensus, vector consensus and atomic …

This paper presents a photometric stereo method that is purely pixelwise and handles
general isotropic surfaces in a stable manner. Following the recently proposed sum-of-lobes …

To solve consensus, distributed systems have to be equipped with oracles such as a failure
detector, a leader capability, or a random number generator. For each oracle, various …