Abstract
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 language | English |
|---|---|
| Pages (from-to) | 592-616 |
| Number of pages | 25 |
| Journal | Journal of Computer and System Sciences |
| Volume | 72 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jun 2006 |
| Externally published | Yes |
Bibliographical note
Funding Information:* Corresponding author. E-mail addresses: [email protected] (Y. Hassin), [email protected] (D. Peleg). 1 Supported in part by a grant from the Israel Ministry of Science and Art.
Funding
* Corresponding author. E-mail addresses: [email protected] (Y. Hassin), [email protected] (D. Peleg). 1 Supported in part by a grant from the Israel Ministry of Science and Art.
| Funders | Funder number |
|---|---|
| Israel Ministry of Science and Art |
Keywords
- Nondominated coteries
- Probe complexity
- Quorum systems