{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T19:40:01Z","timestamp":1737574801924,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665311"},{"type":"electronic","value":"9783540481690"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48169-9_8","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T05:36:33Z","timestamp":1194240993000},"page":"109-122","source":"Crossref","is-referenced-by-count":0,"title":["Non-blocking Asynchronous Byzantine Quorum Systems"],"prefix":"10.1007","author":[{"given":"Rida A.","family":"Bazzi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/103727.103728","volume":"9","author":"D. Agrawal","year":"1991","unstructured":"D. Agrawal and A. El-Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems, 9(1):1\u201320,1991.","journal-title":"ACM Transactions on Computer Systems"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"R. A. Bazzi. Planar Quorums In Proceedings of the 10th International Workshop on Distributed Algorithms, pages 251\u2013268, October 1996.","DOI":"10.1007\/3-540-61769-8_17"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"R. A. Bazzi. Synchronous Byzantine Quorum Systems In Proceedings of the Sixteenth ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, 1997. Full version submitted for publication.","DOI":"10.1145\/259380.259454"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/4221.4223","volume":"32","author":"H. Garcia-Molina","year":"1985","unstructured":"H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. Journal of the ACM, 32(4):481\u2013860, 1985.","journal-title":"Journal of the ACM"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"D. K. Gifford. Weighted Voting for Replicated Data Proceeding of 7th ACM Symposium on Operating Systems Principles, pages 150\u2013162, December 1979.","DOI":"10.1145\/800215.806583"},{"issue":"9","key":"8_CR6","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1109\/12.83661","volume":"40","author":"A. Kumar","year":"1991","unstructured":"A. Kumar. Hierarchical quorum consensus: A new algorithm for managing replicated data. IEEE Transactions of Computers, 40(9):996\u20131004,1991.","journal-title":"IEEE Transactions of Computers"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"A. Kumar., M. Rabinovich, and R. Sinha. A performance study of general grid structures for replicated data. In Proceedings of International Conference on Distributed Computing Systems, pages 178\u2013185, May, 1993.","DOI":"10.1109\/ICDCS.1993.287710"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"M. Maekawa. A $$ \\sqrt n $$ algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145\u2013159,1985.","journal-title":"ACM Transactions on Computer Systems"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"D. Malkhi and M. Reiter. Byzantine Quorum Systems. In Proceedings of ACM 29th Symposium on Theory of Computing, May, 1997.","DOI":"10.1145\/258533.258650"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"D. Malkhi, M. Reiter, and A. Wool. The load and availability of Byzantine quorum systems. In Proceedings of the Sixteenth ACM Symposium on Principles of Distributed Computing, August, 1997.","DOI":"10.1145\/259380.259450"},{"key":"8_CR11","unstructured":"M. L. Neilsen Quorum Structures in Distributed Systems. Ph.D. Thesis, Department of Computer and Information Sciences, Kansas State University, 1992."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"M. Naor and A. Wool The Load, capacity and availability of quorum systems. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 214\u2013225. 1994.","DOI":"10.1109\/SFCS.1994.365692"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"D. Peleg and A. Wool. How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems. In Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, pages 290\u2013299, 1996.","DOI":"10.1145\/248052.248112"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/inco.1995.1169","volume":"123","author":"D. Peleg","year":"1995","unstructured":"D. Peleg and A. Wool. The availability of quorum systems. Information and Computation, 123(2):210\u2013223, 1995.","journal-title":"Information and Computation"},{"key":"8_CR15","unstructured":"D. Skeen. A quorum-based commit protocol. In Proceedings of 6th Berkeley Workshop on Distributed Data Management and Computer Networks, pages 69\u201380, 1982."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48169-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T03:00:09Z","timestamp":1737514809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48169-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665311","9783540481690"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48169-9_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}