{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:37:52Z","timestamp":1781030272133,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s00446-004-0114-3","type":"journal-article","created":{"date-parts":[[2005,5,11]],"date-time":"2005-05-11T08:36:18Z","timestamp":1115800578000},"page":"311-322","source":"Crossref","is-referenced-by-count":11,"title":["Scalable and dynamic quorum systems"],"prefix":"10.1007","volume":"17","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"steingraeber_2005-05-10_10-40-12_CR1","doi-asserted-by":"crossref","unstructured":"El Abbadi A, Skeen D, Cristian F: An efficient, fault-tolerant protocal for replicated data management. In: Proceedings of the 5th ACM SIGACT\/SIGMOD Conference on Principles of Database Systems, 1985, pp 215-229","DOI":"10.1145\/325405.325443"},{"key":"steingraeber_2005-05-10_10-40-12_CR2","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: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003, p 40","DOI":"10.1109\/IPDPS.2003.1213125"},{"key":"steingraeber_2005-05-10_10-40-12_CR3","doi-asserted-by":"crossref","unstructured":"Abraham I, Malkhi D: Probabilistic quorums for dynamic systmes. In: Proceedings of the 17th International Symposium on Distributed Computing (DISC), 2003, pp 60-74","DOI":"10.1007\/978-3-540-39989-6_5"},{"key":"steingraeber_2005-05-10_10-40-12_CR4","doi-asserted-by":"crossref","unstructured":"Adler M, Halperin E, Karp RM, Vazirani VV: A stochastic process on the hypercube with applications to peer-to-peer networks. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC), 2003, pp 575-584","DOI":"10.1145\/780542.780626"},{"key":"steingraeber_2005-05-10_10-40-12_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0020-0190(97)00145-2","volume":"64","author":"Agrawal","year":"1","unstructured":"Agrawal D, Egecioglu O, El Abbadi A: Billiard quorums on the grid. Information Processing Letters 64(1):9-16 (1997)","journal-title":"Information Processing Letters"},{"key":"steingraeber_2005-05-10_10-40-12_CR6","doi-asserted-by":"crossref","unstructured":"Aizenman M, Chayes J, Chayes L, Frohlich J, Russo L: On a sharp transition from area low to perimeter low in a system of random surfaces. Commun Math Phys 92:19-69, 1983.","DOI":"10.1007\/BF01206313"},{"key":"steingraeber_2005-05-10_10-40-12_CR7","doi-asserted-by":"crossref","unstructured":"Bazzi RA: Planar quorums. In: Distributed Algorithms, 10th International Workshop, WDAG \u201896, pp 251-268","DOI":"10.1007\/3-540-61769-8_17"},{"key":"steingraeber_2005-05-10_10-40-12_CR8","doi-asserted-by":"crossref","unstructured":"Bearden M, Bianchini RP Jr: A fault-tolerant algorithm for decentralized on-line quorum adaptation. In: Symposium on Fault-Tolerant Computing, 1998, pp 262-271","DOI":"10.1109\/FTCS.1998.689477"},{"key":"steingraeber_2005-05-10_10-40-12_CR9","doi-asserted-by":"crossref","unstructured":"Bollobas B, Riordan O: The critical probability for random voronoi percolation in the plane is 1\/2. In: Front for the Mathematics ArXiv, math.PR\/0410336, 14 October 2004","DOI":"10.1007\/s00440-005-0490-z"},{"key":"steingraeber_2005-05-10_10-40-12_CR10","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"Garcia-Molina","year":"4","unstructured":"Garcia-Molina H, Barbara D: How to assign votes in a distributed system. J Assoc Comput Mach 32(4):841-855 (1985)","journal-title":"J Assoc Comput Mach"},{"key":"steingraeber_2005-05-10_10-40-12_CR11","unstructured":"Goldreich O: Randomized Methods in Computation - Lecture Notes. http:\/\/www.wisdom.weizmann.ac.il\/~oded\/rnd.html, 2001"},{"key":"steingraeber_2005-05-10_10-40-12_CR12","doi-asserted-by":"crossref","unstructured":"Grimmett G: Percolation, 2nd ed. Springer-Verlag, 1999","DOI":"10.1007\/978-3-662-03981-6"},{"key":"steingraeber_2005-05-10_10-40-12_CR13","doi-asserted-by":"crossref","unstructured":"Haas ZJ, Liang B: Ad hoc mobility management with uniform quorum systems. IEEE\/ACM Trans Network 7(2):228-240 (1999)","DOI":"10.1109\/90.769770"},{"key":"steingraeber_2005-05-10_10-40-12_CR14","doi-asserted-by":"crossref","unstructured":"Hassin Y, Peleg D: Average probe complexity in quorum systems. In: 20th ACM Symposium on Principles of Distributed Computing (PODC), 2001, pp 180-189","DOI":"10.1145\/383962.384014"},{"key":"steingraeber_2005-05-10_10-40-12_CR15","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/22952.22953","volume":"Syst","author":"Herlihy","year":"1987","unstructured":"Herlihy M: Dynamic quorum adjustment for partitioned data. ACM Trans Database Syst (TODS) 12:170-194 (1987)","journal-title":"ACM Trans Database"},{"key":"steingraeber_2005-05-10_10-40-12_CR16","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/78922.78926","volume":"15","author":"Jajodia","year":"2","unstructured":"Jajodia S. Mutchler D: Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans Database Syst 15(2):230-280 (1990)","journal-title":"ACM Trans Database Syst"},{"key":"steingraeber_2005-05-10_10-40-12_CR17","doi-asserted-by":"crossref","unstructured":"Karumanchi G, Muralidharan S, Prakash R: Information dissemination in partitionable mobile ad hoc networks. In: Proceedings of IEEE Symposium on Reliable Distributed Systems, 1999, pp 4-13","DOI":"10.1109\/RELDIS.1999.805078"},{"key":"steingraeber_2005-05-10_10-40-12_CR18","first-page":"71","volume":"25","author":"Liggett","year":"1","unstructured":"Liggett TL, Schonmann RH, Stacey AM: Domination by product measures. The Annals of Probability 25(1):71-95 (1997)","journal-title":"The Annals of Probability"},{"key":"steingraeber_2005-05-10_10-40-12_CR19","doi-asserted-by":"crossref","unstructured":"Lotem EY, Keidar I, Dolev D: Dynamic voting for consistent primary components. In: Symposium on Principles of Distributed Computing (PODC), 1997, pp 63-71","DOI":"10.1145\/259380.259424"},{"key":"steingraeber_2005-05-10_10-40-12_CR20","doi-asserted-by":"crossref","unstructured":"Lynch N, Shvartsman A: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Symposium on Fault-Tolerant Computing, 1997, pp 272-281","DOI":"10.1109\/FTCS.1997.614100"},{"key":"steingraeber_2005-05-10_10-40-12_CR21","doi-asserted-by":"crossref","unstructured":"Lynch N, Shvartsman A: Rambo: A reconfigurable atomic memory service for dynamic networks. In: Proceedings of the 16th International Symposium on Distributed Computing, 2002, pp 173-190","DOI":"10.1007\/3-540-36108-1_12"},{"key":"steingraeber_2005-05-10_10-40-12_CR22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"Maekawa","year":"2","unstructured":"Maekawa M: A $\\sqrt{N}$ algorithm for mutual exclusion in decentralized systems. ACM Trans Comput Syst 3(2):145-159 (1985)","journal-title":"ACM Trans Comput Syst"},{"key":"steingraeber_2005-05-10_10-40-12_CR23","doi-asserted-by":"crossref","unstructured":"Malkhi D, Naor M, Ratajczak D: Viceroy: A scalable and dynamic emulation of the butterfly. In: ACM Conf. on Principles of Distributed Computing (PODC), 2002, pp 183-192","DOI":"10.1007\/3-540-36108-1"},{"key":"steingraeber_2005-05-10_10-40-12_CR24","first-page":"856","volume":"33","author":"Menshikov","year":"1986","unstructured":"Menshikov MV: Coincidence of critical points in percolation problems. Soviet Mathematics Doklady 33:856-859 (1986)","journal-title":"Soviet Mathematics Doklady"},{"key":"steingraeber_2005-05-10_10-40-12_CR25","doi-asserted-by":"crossref","unstructured":"Motwani R, Raghavan P: Randomized Algorithms. Cambridge University Press, 1997","DOI":"10.1201\/9781420049503-c16"},{"key":"steingraeber_2005-05-10_10-40-12_CR26","doi-asserted-by":"crossref","unstructured":"Nadav U, Naor M: Fault-tolerant storage in a dynamic environment. In: Proceedings of the 18th Annual Conference on Distributed Computing (DISC). Lecture Notes in Computer Science 3274, Springer, 2004, pp 390-404","DOI":"10.1007\/978-3-540-30186-8_28"},{"key":"steingraeber_2005-05-10_10-40-12_CR27","doi-asserted-by":"crossref","unstructured":"Naor M, Wieder U: Novel architectures for p2p applications: the continuous-discrete approach. In: Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2003, pp 50-59","DOI":"10.1145\/777412.777421"},{"key":"steingraeber_2005-05-10_10-40-12_CR28","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/71.722223","volume":"9","author":"Naor","year":"9","unstructured":"Naor M, Wool A: Access control and signatures via quorum secret sharing. IEEE Trans Parallel Distrib Syst 9(9):909-922 (1998)","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"steingraeber_2005-05-10_10-40-12_CR29","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/S0097539795281232","volume":"27","author":"Naor","year":"2","unstructured":"Naor M, Wool A: The load, capacity, and availability of quorum systems. SIAM J Comput 27(2):423-447 (1998)","journal-title":"SIAM J Comput"},{"key":"steingraeber_2005-05-10_10-40-12_CR30","doi-asserted-by":"crossref","unstructured":"Okabe A, Boots B, Sugihara K, Chiu SN: Spatial Tessellations -- Concepts and Applications of Voronoi Diagrams. Wiley, Chichester, 2nd ed., 2000","DOI":"10.1002\/9780470317013"},{"key":"steingraeber_2005-05-10_10-40-12_CR31","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/S0895480198343819","volume":"15","author":"Peleg","year":"3","unstructured":"Peleg D, Wool A: How to be an efficient snoop, or the probe complexity of quorum systems. SIAM J Discrete Math 15(3):416-433 (2002)","journal-title":"SIAM J Discrete Math"},{"key":"steingraeber_2005-05-10_10-40-12_CR32","doi-asserted-by":"crossref","unstructured":"De Prisco R, Fekete A, Lynch N, Shvartsman A: A dynamic view-oriented group communication service. In: Symposium on Principles of Distributed Computing (PODC), 1998, pp 227-236","DOI":"10.1145\/277697.277739"},{"key":"steingraeber_2005-05-10_10-40-12_CR33","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, pp 161-172","DOI":"10.1145\/383059.383072"},{"key":"steingraeber_2005-05-10_10-40-12_CR34","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/24068.28052","volume":"5","author":"Sanders","year":"3","unstructured":"Sanders BA: The information structure of distributed mutual exclusion algorithms. ACM Trans Comput Syst 5(3):284-299 (1987)","journal-title":"ACM Trans Comput Syst"},{"key":"steingraeber_2005-05-10_10-40-12_CR35","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: Proceedings of the 2001 ACM SIGCOMM Conference, 2001, pp 149-160","DOI":"10.1145\/383059.383071"},{"key":"steingraeber_2005-05-10_10-40-12_CR36","unstructured":"Stojmenovi\u0107 I, Pena PEV: A scalable quorum based location update scheme for routing in ad hoc wireless networks. Technical Report TR-99-09, SITE, University of Ottawa, September 1999"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-004-0114-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-004-0114-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-004-0114-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T06:05:58Z","timestamp":1735711558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-004-0114-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["114"],"URL":"https:\/\/doi.org\/10.1007\/s00446-004-0114-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}