{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:45:11Z","timestamp":1750308311859,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933058","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"349-351","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[{"name":"The Interdisciplinary Center, Herzliya, Israel"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167119"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331529"},{"key":"e_1_3_2_1_4_1","first-page":"163","article-title":"Memory requirements for agreement among unreliable asynchronous processes","volume":"4","author":"Loui M.C.","year":"1987","unstructured":"M.C. Loui and H. Abu-Amara . Memory requirements for agreement among unreliable asynchronous processes . Advances in Computing Research , 4 : 163 -- 183 , 1987 . M.C. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163--183, 1987.","journal-title":"Advances in Computing Research"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796307698"},{"key":"e_1_3_2_1_6_1","volume-title":"Synchronization Algorithms and Concurrent Programming. Pearson \/ Prentice-Hall. ISBN 0--131--97259--6, 423 pages","author":"Taubenfeld G.","year":"2006","unstructured":"G. Taubenfeld . Synchronization Algorithms and Concurrent Programming. Pearson \/ Prentice-Hall. ISBN 0--131--97259--6, 423 pages , 2006 . G. Taubenfeld. Synchronization Algorithms and Concurrent Programming. Pearson \/ Prentice-Hall. ISBN 0--131--97259--6, 423 pages, 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933058"}],"event":{"name":"PODC '16: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago Illinois USA","acronym":"PODC '16"},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933058","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:38:51Z","timestamp":1750268331000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933058"}},"subtitle":["Computing in the Presence of Weak Crash Failures"],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":7,"alternative-id":["10.1145\/2933057.2933058","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933058","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}