ACM Home Page
Please provide us with feedback. Feedback
Crumbling walls: a class of practical and efficient quorum systems
Full text PdfPdf (1.04 MB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing table of contents
Ottowa, Ontario, Canada
Pages: 120 - 129  
Year of Publication: 1995
ISBN:0-89791-710-3
Authors
David Peleg  Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel
Avishai Wool  Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 27,   Citation Count: 15
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/224964.224978
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
ADKM92
Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A communication subsystem for high availability. In Proc. ~~nd Inter. Syrup. Fault- Tolerant Comp. Sys., pages 76-84, 1992.
AE91
 
BG87
 
CAA90
 
Con
N. Condorcet. Essai sur l'application de l'analyse ~ la probabilit~ des decisions rendues k la pluralite des voix. Paris, 1785.
DGS85
 
DKK+94
 
EL75
P. ErdSs and L. Lov~sz. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, pages 609-627. Colloq. Math. Soc. J~nos Bolyai 10, 1975.
GB85
Gif79
 
Her84
 
HMP95
 
HR90
 
IK93
 
KC91
 
Knu68
 
KRS93
A. Kumar, M. Rabinovich, and R. K. Sinha. A performance study of general grid structures for replicated data. In Proc. Inter. Conf. Dist. Comp. Sys., 1993.
 
Kum91
 
Lov73
L. Lov~sz. Coverings and colorings of hypergraphs. In Proc. ~th Southeastern Con/. Combinatorics, Graph Theory and Computing, pages 3-12, 1973.
Mae85
 
MP92a
Y. Marcus and D. Peleg. Construction methods for quorum systems. Technical Report CS92- 33, The Weizrnann Institute of Science, Rehovot, Israel, 1992.
 
MP92b
Y. Marcus and D. Peleg. Load balancing in quorum systems. Technical Report CS92-34, The Weizmann Institute of Science, Rehovot, Israel, 1992.
 
MV88
S.J. Mullender and P. M. B. Vit~nyi. Distributed match-making. Algorithmica, 3:367- 391, 1988.
 
Nei92
 
NW94
M. Naor and A. Wool. The load, capacity and availability of quorum systems. In Proc. 35th IEEE Syrup. Found. o/Comp. Science, pages 214-225, 1994.
 
NW95a
 
NW95b
M. Naor and A. Wool. Access control and signatures via quorum secret sharing, 1995. Manuscript.
 
PW93
 
PW94
 
Ray86
 
RST92
 
RT91
 
SB94
Tho79
 
YG94

CITED BY  15

Collaborative Colleagues:
David Peleg: colleagues
Avishai Wool: colleagues