Journal article

A Topological Treatment of Early-Deciding Set-Agreement

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus problem.

Related material