Bitcoin's success as a global cryptocurrency has paved the way for the emergence of
blockchain, a revolutionary category of distributed systems. However, the growing popularity …

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 …

This article introduces and explores the condition-based approach to solve the consensus
problem in asynchronous systems. The approach studies conditions that identify sets of …

This paper presents a very simple consensus protocol that converges in a single
communication step in favorable circumstances. Those situations occur when “enough” …

It is now well recognized that consensus is a fundamental problem one has to solve to
implement reliable applications on top of unreliable asynchronous distributed systems prone …

Since the first version of Chandra and Toueg's seminal paper titled" Unreliable failure
detectors for reliable distributed systems" in 1991, the failure detector concept has been …

The paper considers the Byzantine agreement problem in a fully asynchronous network,
where some participants may be actively malicious. This is an important building block for …

Average consensus algorithms are protocols to compute the average value of all sensor
measurements via near neighbors communications. They offer a natural tradeoff between …

This paper is on consensus protocols for asynchronous distributed systems prone to process
crashes, but equipped with Chandra-Toueg's (1996) unreliable failure detectors. It presents …