Publication
Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
This paper considers the k-set-agreement problem in a synchronous message passing distributed system where up to t processes can fail by crashing. We determine the number of communication rounds needed for all correct processes to reach a decision in a given run, as a function of k, the degree of coordination, and f
Nicola Marzari, Davide Campi, Davide Grassano
Romain Christophe Rémy Fleury, Haoye Qin, Zhe Zhang, Aleksi Antoine Bossart, Zhechen Zhang