Unbeatable Set Consensus via Topological and Combinatorial Reasoning

DOI10.1145/2933057.2933120zbMath1373.68081arXiv1605.07354OpenAlexW2397569458MaRDI QIDQ5361924

Yoram Moses, Yannai A. Gonczarowski, Armando Castañeda

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

optimalityknowledgetopology\(k\)-set consensusunbeatabilityuniform \(k\)-set consensus

Mathematics Subject Classification ID

Distributed systems (68M14) Simplicial sets and complexes in algebraic topology (55U10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Combinatorial aspects of simplicial complexes (05E45)

Related Items (3)

Unbeatable consensus ⋮ Unnamed Item ⋮ A simplicial complex model for dynamic epistemic logic to study distributed task computability

This page was built for publication: Unbeatable Set Consensus via Topological and Combinatorial Reasoning