On the impossibility of group membership
From MaRDI portal
Publication:2942744
DOI10.1145/248052.248120zbMath1321.68067OpenAlexW2013860911MaRDI QIDQ2942744
Bernadette Charron-Bost, Vassos Hadzilacos, Sam Toueg, 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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (3)
On real-time and non real-time distributed computing ⋮ Hundreds of impossibility results for distributed computing ⋮ The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
This page was built for publication: On the impossibility of group membership
