K set-agreement bounds in round-based models through combinatorial topology

Adam Shimi, Armando Castañeda

Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine b…