Average probe complexity in quorum systems

Y. Hassin, D. Peleg

Research output: Contribution to conferencePaperpeer-review

8 Scopus citations


This paper discusses the probe complexity of randomized algorithms and the deterministic average case probe complexity for some classes of non-dominated coteries, including majority, crumbling walls, tree, wheel and hierarchical quorum systems, and presents upper and lower bounds for the probe complexity of quorum systems in these classes.

Original languageEnglish
Number of pages10
StatePublished - 2001
Externally publishedYes
Event20th Annual ACM Symposium on Principles of Distributed Computing - Newport, Rhode Island, United States
Duration: 26 Aug 200129 Aug 2001


Conference20th Annual ACM Symposium on Principles of Distributed Computing
Country/TerritoryUnited States
CityNewport, Rhode Island

Bibliographical note

Funding Information:
* Corresponding author. E-mail addresses: hassin@mail.jce.ac.il (Y. Hassin), david.peleg@weizmann.ac.il (D. Peleg). 1 Supported in part by a grant from the Israel Ministry of Science and Art.


Dive into the research topics of 'Average probe complexity in quorum systems'. Together they form a unique fingerprint.

Cite this