journal article
oaidoi:10.1016/j.jcss.2005.10.003

Average probe complexity in quorum systems

Authors
Publication date
30 June 2006
Publisher
Elsevier Inc.
Doi

    Abstract

    AbstractThis 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

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/j.jcss.2005.10.003
    Last time updated on 04/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.