{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:36:55Z","timestamp":1781030215790,"version":"3.54.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0020-0190(98)00017-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"223-228","source":"Crossref","is-referenced-by-count":35,"title":["Optimal availability quorum systems: Theory and practice"],"prefix":"10.1016","volume":"65","author":[{"given":"Yair","family":"Amir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avishai","family":"Wool","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0020-0190(98)00017-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/103727.103728","article-title":"An efficient and fault-tolerant solution for distributed mutual exclusion","volume":"9","author":"Agrawal","year":"1991","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB2","series-title":"Ph.D. Thesis","article-title":"Replication using group communication over a dynamic network","author":"Amir","year":"1995"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB3","series-title":"Proc. 26th IEEE Symp. on Fault-Tolerant Computing (FTCS)","first-page":"26","article-title":"Evaluating quorum systems over the Internet","author":"Amir","year":"1996"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB4","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1109\/TC.1987.1676860","article-title":"The reliability of vote mechanisms","volume":"36","author":"Barbara","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(98)00017-9_BIB5","series-title":"Proc. 6th IEEE Internat. Conf. on Data Engineering","first-page":"438","article-title":"The grid protocol: A high performance scheme for maintaining replicated data","author":"Cheung","year":"1990"},{"issue":"3","key":"10.1016\/S0020-0190(98)00017-9_BIB6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/5505.5508","article-title":"Consistency in partitioned networks","volume":"17","author":"Davidson","year":"1985","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(94)00064-6","article-title":"Optimal coteries and voting schemes","volume":"51","author":"Diks","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0020-0190(98)00017-9_BIB8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","article-title":"Intersection theorems for systems of finite sets","volume":"12","author":"Erd'\u0301os","year":"1961","journal-title":"Quart. J. Math. Oxford"},{"issue":"4","key":"10.1016\/S0020-0190(98)00017-9_BIB9","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/4221.4223","article-title":"How to assign votes in a distributed system","volume":"32","author":"Garcia-Molina","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB10","article-title":"Replication methods for abstract data types","author":"Herlihy","year":"1984"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0020-0190(91)90199-R","article-title":"A high availability \u221an hierarchical grid algorithm for replicated data","volume":"40","author":"Kumar","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00017-9_BIB12","article-title":"A highly available paradigm for consistent object replication","author":"Keidar","year":"1994"},{"issue":"9","key":"10.1016\/S0020-0190(98)00017-9_BIB13","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1109\/12.83661","article-title":"Hierarchical quorum consensus: A new algorithm for managing replicated data","volume":"40","author":"Kumar","year":"1991","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S0020-0190(98)00017-9_BIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","article-title":"A \u221an algorithm for mutual exclusion in decentralized systems","volume":"3","author":"Maekawa","year":"1985","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB15","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01762123","article-title":"Distributed match-making","volume":"3","author":"Mullender","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB16_1","series-title":"Proc. 35th IEEE Symp. on Foundations of Computer Science (FOCS)","first-page":"214","article-title":"The load, capacity and availability of quorum systems","author":"Naor","year":"1994"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB16_2","author":"Naor","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00017-9_BIB17","series-title":"Proc. 3rd ACM Conf. on Comp. and Comm. Security","first-page":"157","article-title":"Access control and signatures via quorum secret sharing","author":"Naor","year":"1996"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB18_1","unstructured":"also available as Theory of Cryptography Library record 96-08"},{"issue":"2","key":"10.1016\/S0020-0190(98)00017-9_BIB19","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/inco.1995.1169","article-title":"The availability of quorum systems","volume":"123","author":"Peleg","year":"1995","journal-title":"Inform. and Comput."},{"issue":"2","key":"10.1016\/S0020-0190(98)00017-9_BIB20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s004460050027","article-title":"Crumbling walls: A class of practical and efficient quorum systems","volume":"10","author":"Peleg","year":"1997","journal-title":"Distributed Comput."},{"key":"10.1016\/S0020-0190(98)00017-9_BIB21","series-title":"Algorithms for Mutual Exclusion","author":"Raynal","year":"1986"},{"issue":"1","key":"10.1016\/S0020-0190(98)00017-9_BIB22","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/71.262589","article-title":"Voting as the optimal static pessimistic scheme for managing replicated data","volume":"5","author":"Spasojevic","year":"1994","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB23","series-title":"Proc. 7th IEEE Symp. on Reliable Distributed Systems","first-page":"138","article-title":"Vote assignments in weighted voting mechanisms","author":"Tong","year":"1988"},{"key":"10.1016\/S0020-0190(98)00017-9_BIB24","series-title":"Proc. 3rd Internat. Conf. on Parallel Distributed Information Systems","first-page":"89","article-title":"Distributed selective dissemination of information","author":"Yan","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000179?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000179?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:54:37Z","timestamp":1556643277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019098000179"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00017-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}