How to be an efficient snoop, or the probe complexity of quorum systems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1996, Pages 290-299

  Peleg, David ^a   Wool, Avishai ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION DISSEMINATION; NETWORK PROTOCOLS; PROGRAM PROCESSORS; SYSTEMS ANALYSIS;

DATA REPLICATION; DISTRIBUTED PROTOCOLS; PROBE COMPLEXITY; QUORUM SYSTEM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0029714340     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)