Average probe complexity in quorum systems

Yehuda Hassin, David Peleg

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


This paper discusses the probe complexity of randomized algorithms and the deterministic average case probe complexity for some classes of nondominated 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
Pages (from-to)592-616
Number of pages25
JournalJournal of Computer and System Sciences
Issue number4
StatePublished - Jun 2006
Externally publishedYes

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.


  • Nondominated coteries
  • Probe complexity
  • Quorum systems


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

Cite this