{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:32Z","timestamp":1725569972443},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_34","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"472-486","source":"Crossref","is-referenced-by-count":2,"title":["The Dynamic And-Or Quorum System"],"prefix":"10.1007","author":[{"given":"Uri","family":"Nadav","sequence":"first","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: IPDPS (2003)","DOI":"10.1109\/IPDPS.2003.1213125"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-39989-6_5","volume-title":"Distributed Computing","author":"I. Abraham","year":"2003","unstructured":"Abraham, I., Malkhi, D.: Probabilistic quorums for dynamic systmes. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 60\u201374. Springer, Heidelberg (2003)"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Distributed Algorithms","author":"R. Bazzi","year":"1996","unstructured":"Bazzi, R.: Planar quorums. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol.\u00a01151. Springer, Heidelberg (1996)"},{"key":"34_CR4","unstructured":"Fraigniaud, P., Gauron, P.: An overview of the content-addressable network d2b. In: PODC (2003)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Hassin, Y., Peleg, D.: Average probe complexity in quorum systems. In: PODC (2001)","DOI":"10.1145\/383962.384014"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b11823","volume-title":"Peer-to-Peer Systems II","author":"M.F. Kaashoek","year":"2003","unstructured":"Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Karger, D., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: SPAA (2004)","DOI":"10.1145\/1007912.1007919"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Liggett, T., Schonmann, R., Stacey, A.: Domination by product measures. The Annals of Probability\u00a025(1) (1997)","DOI":"10.1214\/aop\/1024404279"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-45748-8_28","volume-title":"Peer-to-Peer Systems","author":"N. Lynch","year":"2002","unstructured":"Lynch, N., Malkhi, D., Ratajczak, D.: Atomic data access in distributed hash tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 295. Springer, Heidelberg (2002)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: PODC (2002)","DOI":"10.1145\/571825.571857"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Reiter, M., Wright, R.: Probabilistic quorum systems. In: PODC (1997)","DOI":"10.1145\/259380.259458"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Manku, G.S.: Balanced binary trees for ID management and load balance in distributed hash tables. In: PODC (2004)","DOI":"10.1145\/1011767.1011797"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-540-30186-8_28","volume-title":"Distributed Computing","author":"U. Nadav","year":"2004","unstructured":"Nadav, U., Naor, M.: Fault-tolerant storage in a dynamic environment. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 390\u2013404. Springer, Heidelberg (2004)"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuous-discrete approach. In: SPAA (2003)","DOI":"10.1145\/777412.777421"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Scalable and dynamic quorum systems. In: PODC (2003)","DOI":"10.1145\/872035.872052"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Naor, M., Wool, A.: The load, capacity, and availability of quorum systems. SIAM Journal on Computing\u00a027(2) (1998)","DOI":"10.1137\/S0097539795281232"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Peleg, D., Wool, A.: The availability of quorum systems. Inf. Comput.\u00a0123(2) (1995)","DOI":"10.1006\/inco.1995.1169"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Peleg, D., Wool, A.: How to be an efficient snoop, or the probe complexity of quorum systems. SIAM Journal on Discrete Mathematics\u00a015(3) (2002)","DOI":"10.1137\/S0895480198343819"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383072"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: ACM SIGCOMM Conference (2001)","DOI":"10.1145\/383059.383071"},{"key":"34_CR21","unstructured":"Zhao, B.Y., Kubiatowicz, J.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB CSD 01-1141, University of California at Berkeley (2001)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:50Z","timestamp":1619507630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11561927_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}