How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
David Peleg, Avishai Wool · 1996
Article How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract) Share on Authors: David Peleg Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, IsraelView Profile , Avishai Wool Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, IsraelView Profile Authors Info & Claims PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computingMay 1996 Pages 290–299https://doi.org/10.1145/248052.248112Online:01 May 1996Publication History 15citation207DownloadsMetricsTotal Citations15Total Downloads207Last 12 Months2Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access