{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:29:33Z","timestamp":1740547773178,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_17","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T21:47:42Z","timestamp":1283723262000},"page":"185-196","source":"Crossref","is-referenced-by-count":3,"title":["Long-Lived Rambo: Trading Knowledge for Communication"],"prefix":"10.1007","author":[{"given":"Chryssis","family":"Georgiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter M.","family":"Musial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Special Issue on Group Communication Services. 39(4) of Comm. of the ACM (1996)","DOI":"10.1145\/227210.227225"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1996","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message Passing Systems. Journal of the ACM\u00a042(1), 124\u2013142 (1996)","journal-title":"Journal of the ACM"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Birman, K., Joseph, T.: Exploiting virtual synchrony in distributed systems. In: Proceedings of the 11th ACM Symposium on Operating Systems Principles (December 1987)","DOI":"10.21236\/ADA177091"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Englert, B., Shvartsman, A.A.: Graceful quorum reconfiguration in a robust emulation of shared memory. In: Proc. of Inter. Conf. on Dist.d Computer Systems, pp. 454\u2013463 (2000)","DOI":"10.1109\/ICDCS.2000.840958"},{"key":"17_CR5","unstructured":"Golding, R.A.: Weak-consistency group communication and membership. PhD Thesis, University of California (1992)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Lynch, N., Shvartsman, A.A.: RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In: Proc. of Inter. Conf. on Dependable Systems and Networks, pp. 259\u2013268 (2003)","DOI":"10.1109\/DSN.2003.1209936"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Ghorbani, A., Bhavsar, V.: Training artificial neural networks using variable precision incremental communication. In: Proc. of IEEE World Congress On Computational Intelligence, vol.\u00a03, pp. 1409\u20131414 (1994)","DOI":"10.1109\/ICNN.1994.374492"},{"key":"17_CR8","unstructured":"Guy, R.G., Heidemann, J.S., Mak, W., Page Jr., T.W., Popek, G.J., Rothmeier, D.: Implementation of the Ficus Replicated File System. In: Proc. of Summer USENIX Conference, pp. 63\u201371 (1990)"},{"key":"17_CR9","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Lynch, N., Shvartsman, A.A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Proc. of 16th Inter. Symp. on Dist. Comp., pp. 173\u2013190 (2002)","DOI":"10.1007\/3-540-36108-1_12"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. LCS\/TR-387, MIT (1987)","DOI":"10.1145\/41840.41852"},{"key":"17_CR12","unstructured":"Minsky, Y.: Spreading rumors cheaply, quickly, and reliably. Ph.D Thesis, Cornell University (2002)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Rabinovich, M., Gehani, N., Kononov, A.: Efficient update propagation in epidemic replicated databases. In: Proc. of 5th Int. Conf. on Extending Database Tech., pp. 207\u2013222 (1996)","DOI":"10.1007\/BFb0014154"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"Upfal, E., Wigderson, A.: How to share memory in a distributed system. Journal of the ACM\u00a034(1), 116\u2013127 (1987)","journal-title":"Journal of the ACM"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Vitanyi, P., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: Proc. of 27th IEEE Symposium on Foundations of Computer Science, pp. 233\u2013243 (1986)","DOI":"10.1109\/SFCS.1986.11"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T15:48:19Z","timestamp":1740498499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}