Guerraoui proposed an indulgent solution for the binary consensus problem. Namely, he
showed that an arbitrary behavior of the failure detector never violates safety requirements …

The failure detector approach for solving distributed computing problems has been
celebrated for its modularity. This approach allows the construction of algorithms using …

Inspired by the successful chase for the weakest failure detector in asynchronous message
passing systems with crash failures and surprising relations to synchronous directed …

The recent discovery of the weakest failure detector L for message passing set agreement
has renewed the interest in exploring the border between solvable and unsolvable problems …

Failure detectors (FD) s are celebrated for their modularity in solving distributed problems.
Algorithms are constructed using FD building blocks. Synchrony assumptions to implement …

Failure detectors have long been viewed as abstractions for the synchronism present in
distributed system models. However, investigations into the exact amount of synchronism …

This paper presents two weak partially synchronous system models M anti (nk) and M sink
(nk), which are just strong enough for solving k-set agreement: We introduce the generalized …

It is proven that the problem of type reconstruction in the polymorphic lambda-calculus of
rank two is polynomial-time equivalent to the problem of type reconstruction in ML, and is …

Distributed computing differs from sequential computing mainly through its abundance of
incomparable models. Whereas everything goes back to Turing machines in sequential …

The celebrated distributed computing approach for building systems and services using
multiple machines continues to expand to new domains. Computation devices nowadays …