Average probe complexity in quorum systems

Yehuda Hassin; David Peleg

doi:10.1016/j.jcss.2005.10.003

Average probe complexity in quorum systems

Yehuda Hassin, David Peleg

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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	https://doi.org/10.1016/j.jcss.2005.10.003
State	Published - Jun 2006
Externally published	Yes

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.

Keywords

Nondominated coteries
Probe complexity
Quorum systems

Access to Document

10.1016/j.jcss.2005.10.003

Cite this

@article{678c83d044794721bb3b8067ffefbc43,

title = "Average probe complexity in quorum systems",

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.",

keywords = "Nondominated coteries, Probe complexity, Quorum systems",

author = "Yehuda Hassin and David Peleg",

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.",

year = "2006",

month = jun,

doi = "10.1016/j.jcss.2005.10.003",

language = "אנגלית",

volume = "72",

pages = "592--616",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "4",

}

TY - JOUR

T1 - Average probe complexity in quorum systems

AU - Hassin, Yehuda

AU - Peleg, David

N1 - 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.

PY - 2006/6

Y1 - 2006/6

N2 - 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.

AB - 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.

KW - Nondominated coteries

KW - Probe complexity

KW - Quorum systems

UR - http://www.scopus.com/inward/record.url?scp=33748142480&partnerID=8YFLogxK

U2 - 10.1016/j.jcss.2005.10.003

DO - 10.1016/j.jcss.2005.10.003

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33748142480

SN - 0022-0000

VL - 72

SP - 592

EP - 616

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 4

ER -

Average probe complexity in quorum systems

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this