Abstract
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 language | English |
|---|---|
| Pages | 180-189 |
| Number of pages | 10 |
| DOIs | |
| State | Published - 2001 |
| Externally published | Yes |
| Event | 20th Annual ACM Symposium on Principles of Distributed Computing - Newport, Rhode Island, United States Duration: 26 Aug 2001 → 29 Aug 2001 |
Conference
| Conference | 20th Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| Country/Territory | United States |
| City | Newport, Rhode Island |
| Period | 26/08/01 → 29/08/01 |
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 |