K-set agreement bounds in round-based models through combinatorial topology
Adam Shimi, Armando Castañeda · 2020
Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of k-set agreement.