On the impossibility of group membership

DOI10.1145/248052.248120MaRDI QIDQ2942744zbMATH OpenOpenAlexFDO

Authors Vassos Hadzilacos, Sam Toueg, Bernadette Charron-Bost, Tushar Deepak Chandra

Publication date 11 September 2015

Published in Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/7205

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Cited in

(4)

• The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
• Hundreds of impossibility results for distributed computing
• On real-time and non real-time distributed computing
• Correctness and fairness of committee-based blockchains: a case study of Tendermint's repeated consensus

This page was built for publication: On the impossibility of group membership

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