{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:31Z","timestamp":1760202751978,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"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":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087807","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"325-334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Coordination Without Prior Agreement"],"prefix":"10.1145","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[{"name":"The Interdisciplinary Center, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79158"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00551ED1V01Y201311DCT012"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792541"},{"key":"e_1_3_2_1_4_1","first-page":"307","volume-title":"Proc. 8th ACM Symp. on Principles of Distributed Computing","author":"Bar-Noy A.","year":"1989","unstructured":"A. Bar-Noy and D. Dolev . Shared memory versus message-passing in an asynchronous distributed environment . In Proc. 8th ACM Symp. on Principles of Distributed Computing , pages 307 -- 318 , 1989 . A. Bar-Noy and D. Dolev. Shared memory versus message-passing in an asynchronous distributed environment. In Proc. 8th ACM Symp. on Principles of Distributed Computing, pages 307--318, 1989."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0137-5"},{"key":"e_1_3_2_1_7_1","first-page":"833","volume-title":"18th annual allerton conference on communication, control and computing","author":"Burns J. E.","year":"1980","unstructured":"J. E. Burns and A. N. Lynch . Mutual exclusion using indivisible reads and writes . In 18th annual allerton conference on communication, control and computing , pages 833 -- 842 , October 1980 . J. E. Burns and A. N. Lynch. Mutual exclusion using indivisible reads and writes. In 18th annual allerton conference on communication, control and computing, pages 833--842, October 1980."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1065"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2011.04.001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/365559.365617"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384008"},{"key":"e_1_3_2_1_13_1","first-page":"54","volume-title":"LNCS 647","author":"Greenberg D.S.","year":"1992","unstructured":"D.S. Greenberg , G. Taubenfeld , and Da-Wei Wang Choice coordination with multiple alternatives. phIn Proc. of the 6th International workshop on distributed algorithms , LNCS 647 , pages 54 -- 68 , 1992 . D.S. Greenberg, G. Taubenfeld, and Da-Wei Wang Choice coordination with multiple alternatives. phIn Proc. of the 6th International workshop on distributed algorithms, LNCS 647, pages 54--68, 1992."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2003.1203503"},{"key":"e_1_3_2_1_16_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_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2013.11.007"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(95)00009-H"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90052-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288965"},{"key":"e_1_3_2_1_22_1","volume-title":"The MIT Press, 1986","author":"Raynal M.","year":"1984","unstructured":"M. Raynal . Algorithms for mutual exclusion . The MIT Press, 1986 . Translation of: Algorithmique du parall\u00e9lisme , 1984 . M. Raynal. Algorithms for mutual exclusion. The MIT Press, 1986. Translation of: Algorithmique du parall\u00e9lisme, 1984."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/72981.72993"},{"key":"e_1_3_2_1_24_1","volume-title":"Synchronization Algorithms and Concurrent Programming. Pearson \/ Prentice-Hall","author":"Taubenfeld G.","year":"2006","unstructured":"G. Taubenfeld . Synchronization Algorithms and Concurrent Programming. Pearson \/ Prentice-Hall , 2006 . ISBN 0--131--97259--6, 423 pages. G. Taubenfeld. Synchronization Algorithms and Concurrent Programming. Pearson \/ Prentice-Hall, 2006. ISBN 0--131--97259--6, 423 pages."},{"key":"e_1_3_2_1_25_1","volume-title":"Obstruction-free consensus for unbounded concurrency. Unpublished manuscript","author":"Taubenfeld G.","year":"2017","unstructured":"G. Taubenfeld . Obstruction-free consensus for unbounded concurrency. Unpublished manuscript , 2017 . G. Taubenfeld. Obstruction-free consensus for unbounded concurrency. Unpublished manuscript, 2017."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050034"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897565"}],"event":{"name":"PODC '17: 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":"Washington DC USA","acronym":"PODC '17"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":26,"alternative-id":["10.1145\/3087801.3087807","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087807","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}