{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T01:10:06Z","timestamp":1791335406716,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540446248","type":"print"},{"value":"9783540446279","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864219_31","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T05:25:39Z","timestamp":1159939539000},"page":"443-458","source":"Crossref","is-referenced-by-count":10,"title":["Byzantine and Multi-writer K-Quorums"],"prefix":"10.1007","author":[{"given":"Amitanand S.","family":"Aiyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Alvisi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rida A.","family":"Bazzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Algorithms for mutual exclusion","author":"M. Raynal","year":"1986","unstructured":"Raynal, M., Beeson, D.: Algorithms for mutual exclusion. MIT Press, Cambridge (1986)"},{"key":"31_CR2","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proc. of the Third Symposium on Operating Systems Design and Implementation. USENIX Association, Co-sponsored by IEEE TCOS and ACM SIGOPS (1999)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Susan Davidson, H.G.M., Skeen, D.: Consistency in partioned network. Computing Survey\u00a017(3) (1985)","DOI":"10.1145\/5505.5508"},{"key":"31_CR4","unstructured":"Herlihy, M.: Replication methods for abstract data types. Technical Report TR-319. MIT\/LCS (1984)"},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/S0097539795281232","volume":"27","author":"M. Naor","year":"1998","unstructured":"Naor, M., Wool, A.: The load, capacity, and availability of quorum systems. SIAM Journal on Computing\u00a027(2), 423\u2013447 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/inco.1995.1169","volume":"123","author":"D. Peleg","year":"1995","unstructured":"Peleg, D., Wool, A.: The availability of quorum systems. Inf. Comput.\u00a0123(2), 210\u2013223 (1995)","journal-title":"Inf. Comput."},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/inco.2001.3054","volume":"170","author":"D. Malkhi","year":"2001","unstructured":"Malkhi, D., Reiter, M.K., Wool, A., Wright, R.N.: Probabilistic quorum systems. Inf. Comput.\u00a0170(2), 184\u2013206 (2001)","journal-title":"Inf. Comput."},{"key":"31_CR8","first-page":"246","volume-title":"Proc. 23rd PODC","author":"H. Yu","year":"2004","unstructured":"Yu, H.: Signed quorum systems. In: Proc. 23rd PODC, pp. 246\u2013255. ACM Press, New York (2004)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11561927_6","volume-title":"Distributed Computing","author":"A.S. Aiyer","year":"2005","unstructured":"Aiyer, A.S., Alvisi, L., Bazzi, R.A.: On the availability of non-strict quorum systems. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 48\u201362. Springer, Heidelberg (2005)"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. part i: Basic formalism. Distributed Computing\u00a01(2), 77\u2013101 (1986)","journal-title":"Distributed Computing"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-36108-1_21","volume-title":"Distributed Computing","author":"J.P. Martin","year":"2002","unstructured":"Martin, J.P., Alvisi, L., Dahlin, M.: Minimal byzantine storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 311\u2013325. Springer, Heidelberg (2002)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Aiyer, A., Alvisi, L., Bazzi, R.A.: Byzantine and multi-writer k-quorums. Number TR-06-37 (2006)","DOI":"10.1007\/11864219_31"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864219_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:44:54Z","timestamp":1605642294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864219_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540446248","9783540446279"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11864219_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}