{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:28Z","timestamp":1725467788717},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650669"},{"type":"electronic","value":"9783540496939"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056473","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T04:37:41Z","timestamp":1154234261000},"page":"49-61","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Computing in totally anonymous asynchronous shared memory systems"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alla","family":"Gorbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 291\u2013302. ACM, 1988.","DOI":"10.1145\/62546.62594"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. J. ACM, 40(4):873\u2013890, Sept. 1993.","journal-title":"J. ACM"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"D. Angluin. Local and global properties in networks of processors. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 82\u201393,g 1980.","DOI":"10.1145\/800141.804655"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"H. Attiya, M. Snir, and M. Warmuth. Computing on an anonymous ring. J. ACM, 35(4):845\u2013876, Oct. 1988.","journal-title":"J. ACM"},{"key":"6_CR5","unstructured":"H. Brit and S. Moran. Wait-freedom vs. bounded wait-freedom in public data structures. Universal Journal of Computer Science, pages 2\u201319, Jan. 1996."},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J. E. Burns","year":"1993","unstructured":"J. E. Burns and N. A. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2):171\u2013184, Dec. 1993.","journal-title":"Information and Computation"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. J. ACM, 34(1):77\u201397, Jan. 1987.","journal-title":"J. ACM"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty processor. J. ACM, 32(2):374\u2013382, Apr. 1985.","journal-title":"J. ACM"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1137\/S0097539793254959","volume":"25","author":"M. J. Fischer","year":"1996","unstructured":"M. J. Fischer, S. Moran, S. Rudich, and G. Taubenfeld. The wakeup problem. SIAM J. Comput., 25(6):1332\u20131357, Dec. 1996.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. P. Herlihy","year":"1991","unstructured":"M. P. Herlihy. Wait-free synchronization. ACM Trans. Prog. Lang. Syst., 13(1):124\u2013149, Jan. 1991.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"P. Jayanti and S. Toueg. Wakeup under read\/write atomicity. In J. van Leeuwen and N. Santoro, editors, Proceedings of the 4th International Workshop on Distributed Algorithms, volume 486 of Lecture Notes in Computer Science, pages 277\u2013288. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-54099-7_19"},{"key":"6_CR12","unstructured":"M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. In Advances in Computing Research, Vol. 4, pages 163\u2013183. JAI Press. Inc., 1987."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1996.0837","volume":"24","author":"S. Moran","year":"1997","unstructured":"S. Moran and G. Taubenfeld. A lower bound on wait-free counting. Journal of Algorithms, 24:1\u201319, 1997.","journal-title":"Journal of Algorithms"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90052-4","volume":"26","author":"S. Moran","year":"1987","unstructured":"S. Moran and Y. Wolfsthal. An extended impossibility result for asynchronous complete networks. Inf. Process. Lett., 26:141\u2013151, 1987.","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228\u2013234, Apr. 1980.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:43:44Z","timestamp":1578494624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056473"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650669","9783540496939"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0056473","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"2 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}