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

DOI10.1145/3382734.3405752MaRDI QIDQ5855263zbMATH OpenOpenAlexFDO

Authors Adam Shimi, Armando Castañeda

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2003.02869

zbMATH Keywords

lower boundscombinatorial topologyupper boundsdistributed computabilityround-based modelsset-agreeement

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited in

(2)

• A non-topological proof for the impossibility of \(k\)-set agreement
• Pseudospheres: combinatorics, topology and distributed systems

This page was built for publication: K-set agreement bounds in round-based models through combinatorial topology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855263)