{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T20:29:21Z","timestamp":1791318561670,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540000730","type":"print"},{"value":"9783540361084","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36108-1_12","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:38:36Z","timestamp":1178224716000},"page":"173-190","source":"Crossref","is-referenced-by-count":62,"title":["RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Nancy","family":"Lynch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"issue":"4","key":"12_CR1","volume":"39","year":"1996","unstructured":"Communications of the ACM, special section on group communications, vol. 39, no. 4, 1996.","journal-title":"Communications of the ACM"},{"key":"12_CR2","unstructured":"Y. Amir, D. Dolev, P. Melliar-Smith and L. Moser, \u201cRobust and Efficient Replication Using Group Communication\u201d Tech. Rep. 94-20, Dept. of Computer Science, Hebrew Univ., 1994."},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1996","unstructured":"H. Attiya, A. Bar-Noy and D. Dolev, \u201cSharing Memory Robustly in Message Passing Systems\u201d, J. of the ACM, vol. 42, no. 1, pp. 124\u2013142, 1996.","journal-title":"J. of the ACM"},{"key":"12_CR4","volume-title":"Concurrency Control and Recovery in Database Systems","author":"P.A. Bernstein","year":"1987","unstructured":"P.A. Bernstein, V. Hadzilacos and N. Goodman, \u201cConcurrency Control and Recovery in Database Systems\u201d, Addison-Wesley, Reading, MA, 1987."},{"key":"12_CR5","unstructured":"F. Cristian and F. Schmuck, \u201cAgreeing on Processor Group Membership in Asynchronous Distributed Systems\u201d, TR. CSE95-428, Dept. of Comp. Sci., Univ. of California San Diego."},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/5505.5508","volume":"15","author":"S.B. Davidson","year":"1985","unstructured":"S.B. Davidson, H. Garcia-Molina and D. Skeen, \u201cConsistency in Partitioned Networks\u201d, ACM Computing Surveys, vol. 15, no. 3, pp. 341\u2013370, 1985.","journal-title":"ACM Computing Surveys"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"R. De Prisco, A. Fekete, N. Lynch, A. Shvartsman, \u201cA Dynamic Primary Configuration Group Communication Service\u201d, 13th Int-l Conference of Distributed Computing, 1999.","DOI":"10.1007\/3-540-48169-9_5"},{"key":"12_CR8","unstructured":"Roberto De Prisco, Nancy Lynch, Alex Shvartsman, Nicole Immorlica and Toh Ne Win \u201cA Formal Treatment of Lamport\u2019s Paxos Algorithm\u201d, manuscript, 2002."},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"C. Dwork, N. A. Lynch, L. J. Stockmeyer, \u201cConsensus in the presence of partial synchrony\u201d, J. of ACM, 35(2), pp. 288\u2013323, 1988.","journal-title":"J. of ACM"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"B. Englert and A.A. Shvartsman, Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory, in Proc. International Conference on Distributed Computer Systems (ICDCS\u20192000), pp. 454\u2013463, 2000.","DOI":"10.1109\/ICDCS.2000.840958"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/377769.377776","volume":"19","author":"A. Fekete","year":"2001","unstructured":"A. Fekete, N. Lynch and A. Shvartsman \u201cSpecifying and using a partitionable group communication service\u201d, ACM Trans. on Computer Systems, vol. 19, no. 2, pp. 171\u2013216, 2001.","journal-title":"ACM Trans. on Computer Systems"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"H. Garcia-Molina","year":"1985","unstructured":"H. Garcia-Molina and D. Barbara, \u201cHow to Assign Votes in a Distributed System,\u201d J. of the ACM, vol. 32, no. 4, pp. 841\u2013860, 1985.","journal-title":"J. of the ACM"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"D.K. Gifford, \u201cWeighted Voting for Replicated Data\u201d, in Proc. of 7th ACM Symp. on Oper. Sys. Princ., pp. 150\u2013162, 1979.","DOI":"10.1145\/800215.806583"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/22952.22953","volume":"12","author":"M.P. Herlihy","year":"1987","unstructured":"M.P. Herlihy, \u201cDynamic Quorum Adjustment for Partitioned Data\u201d, ACM Trans. on Database Systems, 12(2), pp. 170\u2013194, 1987.","journal-title":"ACM Trans. on Database Systems"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"R. Guerraoui and A. Schiper, \u201cConsensus Service: A Modular Approach For Building Fault-Tolerant Agreement Protocols in Distributed Systems\u201d, Proc. of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pp. 168\u2013177, 1996.","DOI":"10.1109\/FTCS.1996.534604"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"I. Keidar and D. Dolev, \u201cEfficient Message Ordering in Dynamic Networks\u201d, in Proc. of 15th Annual ACM Symp. on Princ. of Distr. Comput., pp. 68\u201376, 1996.","DOI":"10.1145\/248052.248062"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Leslie Lamport, \u201cThe Part-Time Parliament\u201d, ACM Transactions on Computer Systems, 16(2) 133\u2013169, 1998.","journal-title":"ACM Transactions on Computer Systems"},{"key":"12_CR18","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"N.A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, San Mateo, CA, 1996."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"N. Lynch and A. Shvartsman. Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. 27th Int-l Symp. on Fault-Tolerant Comp., pp. 272\u2013281, 1997.","DOI":"10.1109\/FTCS.1997.614100"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Nancy Lynch and Alex Shvartsman. RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. MIT-LCS-TR-856, 2002","DOI":"10.1007\/3-540-36108-1_12"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"E. Upfal and A. Wigderson, How to share memory in a distributed system, Journal of the ACM, 34(1):116\u2013127, 1987.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36108-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:17:42Z","timestamp":1556374662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36108-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000730","9783540361084"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-36108-1_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}