{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:48Z","timestamp":1750307508149,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,10]],"date-time":"2009-08-10T00:00:00Z","timestamp":1249862400000},"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":[[2009,8,10]]},"DOI":"10.1145\/1582716.1582735","type":"proceedings-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T13:29:27Z","timestamp":1249997367000},"page":"83-91","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["The weakest failure detector for solving k-set agreement"],"prefix":"10.1145","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2009,8,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11947950_36"},{"key":"e_1_3_2_1_2_1","volume-title":"PODC","author":"Fern Antonio","year":"2009","unstructured":"Antonio Fern ández Anta, Sergio Rajsbaum , and Corentin Travers . Weakest failure detectors via an egg-laying simulation (brief announcement) . In PODC , 2009 . Antonio Fernández Anta, Sergio Rajsbaum, and Corentin Travers. Weakest failure detectors via an egg-laying simulation (brief announcement). In PODC, 2009."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167119"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164056"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008933"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234549"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/93385.93431"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2393794.2393808"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00122-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582769"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281135"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0079-3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0043-z"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167125"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400763"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645951.675468"},{"key":"e_1_3_2_1_20_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.H. Abu-Amara . Memory requirements for agreement among unreliable asynchronous processes . Advances in Computing Research , 4 : 163 -- 183 , 1987 . M.C. Loui and H.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_21_1","volume-title":"Rump session at PODC","author":"Raynal Michel","year":"2007","unstructured":"Michel Raynal . K-anti-Omega, August 2007. Rump session at PODC 2007 . Michel Raynal. K-anti-Omega, August 2007. Rump session at PODC 2007."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11945529_2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167122"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400761"}],"event":{"name":"PODC '09: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Calgary AB Canada","acronym":"PODC '09"},"container-title":["Proceedings of the 28th ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582716.1582735","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1582716.1582735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:57Z","timestamp":1750249077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582716.1582735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,10]]},"references-count":23,"alternative-id":["10.1145\/1582716.1582735","10.1145\/1582716"],"URL":"https:\/\/doi.org\/10.1145\/1582716.1582735","relation":{},"subject":[],"published":{"date-parts":[[2009,8,10]]},"assertion":[{"value":"2009-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}