{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:33:13Z","timestamp":1763415193474},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/bfb0020440","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:21:02Z","timestamp":1131844862000},"page":"280-295","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Using failure detectors to solve consensus in asynchronous shared-memory systems"],"prefix":"10.1007","author":[{"given":"Wai-Kau","family":"Lo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassos","family":"Hadzilacos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt and Nir Shavit. Atomic snapshots of shared memory. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 1\u201313, August 1990.","DOI":"10.21236\/ADA222765"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Yehuda Afek, David S. Greenberg, Michael Merritt, and Gadi Taubenfeld. Computing with faulty shared memory. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 47\u201358, August 1992.","DOI":"10.1145\/135419.135431"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"James Aspnes and Maurice Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11:441\u2013461, 1990.","journal-title":"Journal of Algorithms"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocol. In Proceedings of the 2th ACM Symposium on Principles of Distributed Computing, pages 27\u201330, August 1983.","DOI":"10.1145\/800221.806707"},{"key":"21_CR5","volume-title":"Technical report","author":"T. D. Chandra","year":"1993","unstructured":"Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, August 1992. Also Technical report, Department of Computer Science, Cornell University, 1993, Ithaca, NY 14853-7501."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for asynchronous systems. In Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, August 1991.","DOI":"10.1145\/112600.112627"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77\u201397, January 1987.","journal-title":"Journal of the ACM"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Faith Fich, Maurice Herlihy, and Nir Shavit. On the space complexity of randomized synchronization. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 241\u2013249, August 1993.","DOI":"10.1145\/164051.164078"},{"issue":"2","key":"21_CR9","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the Association for Computing Machinery, 32(2):374\u2013382, April 1985.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Prasad Jayanti, Tushar Deepak Chandra, and Sam Toueg. Fault-tolerant wait-free shared objects. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992.","DOI":"10.1109\/SFCS.1992.267776"},{"key":"21_CR11","unstructured":"Michael C. Loui and Hosame H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. In Advances in Computer Research, volume 4, pages 163\u2013183. JAI Press Inc., 1987."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:29:54Z","timestamp":1578526194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020440"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0020440","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}