How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)

DOI10.1145/248052.248112zbMath1321.68092OpenAlexW2084355387MaRDI QIDQ2942742

Avishai Wool, David Peleg

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://doi.org/10.1145/248052.248112

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (7)

Signed quorum systems ⋮ Crumbling walls: a class of practical and efficient quorum systems ⋮ Synchronous Byzantine quorum systems ⋮ Access cost for asynchronous Byzantine quorum systems ⋮ Planar quorums ⋮ Probabilistic quorum systems ⋮ An inclusion hierarchy of irreversible dynamos

This page was built for publication: How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)