How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
From MaRDI portal
Publication:4785693
DOI10.1137/S0895480198343819zbMath1018.68004MaRDI QIDQ4785693
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Combinatorics in computer science (68R05) Distributed systems (68M14)
Related Items (3)
\textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks ⋮ Scalable and dynamic quorum systems ⋮ Average probe complexity in quorum systems
This page was built for publication: How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems