{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:26Z","timestamp":1750220666385,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"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":[[2020,7,31]]},"DOI":"10.1145\/3382734.3405723","type":"proceedings-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:33:55Z","timestamp":1596234835000},"page":"21-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Extending the Wait-free Hierarchy to Multi-Threaded Systems"],"prefix":"10.1145","author":[{"given":"Matthieu","family":"Perrin","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Nantes"}]},{"given":"Achour","family":"Most\u00e9faoui","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Nantes"}]},{"given":"Gr\u00e9goire","family":"Bonin","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Nantes"}]}],"member":"320","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993823"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/992287.992298"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79158"},{"key":"e_1_3_2_1_4_1","volume-title":"Wait-Free Universality of Consensus in the Infinite Arrival Model. In International Symposium on Distributed Computing (DISC).","author":"Bonin Gr\u00e9goire","year":"2019","unstructured":"Gr\u00e9goire Bonin , Achour Most\u00e9faoui , and Matthieu Perrin . 2019 . Wait-Free Universality of Consensus in the Infinite Arrival Model. In International Symposium on Distributed Computing (DISC). Gr\u00e9goire Bonin, Achour Most\u00e9faoui, and Matthieu Perrin. 2019. Wait-Free Universality of Consensus in the Infinite Arrival Model. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767415"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933113"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.09.021"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384008"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_11_1","volume-title":"Power and limits of distributed computing shared memory models. Theor. Comput. Sci. 509","author":"Herlihy Maurice","year":"2013","unstructured":"Maurice Herlihy , Sergio Rajsbaum , and Michel Raynal . 2013. Power and limits of distributed computing shared memory models. Theor. Comput. Sci. 509 ( 2013 ). Maurice Herlihy, Sergio Rajsbaum, and Michel Raynal. 2013. Power and limits of distributed computing shared memory models. Theor. Comput. Sci. 509 (2013)."},{"key":"e_1_3_2_1_12_1","unstructured":"Maurice Herlihy and Nir Shavit. 2008. The art of multiprocessor programming. Morgan Kaufmann.  Maurice Herlihy and Nir Shavit. 2008. The art of multiprocessor programming. Morgan Kaufmann."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_14_1","first-page":"163","article-title":"Memory Requirements for Agreement Among Unreliable Asynchronous Processes","volume":"4","author":"Loui Michael C.","year":"1987","unstructured":"Michael C. Loui and Hosame H. Abu-Amara . 1987 . Memory Requirements for Agreement Among Unreliable Asynchronous Processes . Parallel and Distributed Computing 4 , 4 (1987), 163 -- 183 . Michael C. Loui and Hosame H. Abu-Amara. 1987. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Parallel and Distributed Computing 4, 4 (1987), 163--183.","journal-title":"Parallel and Distributed Computing"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00027-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851170"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/72981.72992"},{"volume-title":"Concurrent Programming - Algorithms, Principles, and Foundations","author":"Raynal Michel","key":"e_1_3_2_1_18_1","unstructured":"Michel Raynal . 2012. Concurrent Programming - Algorithms, Principles, and Foundations . Springer Science & Business Media . Michel Raynal. 2012. Concurrent Programming - Algorithms, Principles, and Foundations. Springer Science & Business Media."},{"key":"e_1_3_2_1_19_1","volume-title":"Distributed Universal Constructions: a Guided Tour. Bulletin of the EATCS 121","author":"Raynal Michel","year":"2017","unstructured":"Michel Raynal . 2017. Distributed Universal Constructions: a Guided Tour. Bulletin of the EATCS 121 ( 2017 ). Michel Raynal. 2017. Distributed Universal Constructions: a Guided Tour. Bulletin of the EATCS 121 (2017)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00845ED1V01Y201804DCT014"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.06.004"}],"event":{"name":"PODC '20: 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":"Virtual Event Italy","acronym":"PODC '20"},"container-title":["Proceedings of the 39th Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405723","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3405723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:50Z","timestamp":1750197770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":21,"alternative-id":["10.1145\/3382734.3405723","10.1145\/3382734"],"URL":"https:\/\/doi.org\/10.1145\/3382734.3405723","relation":{},"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"2020-07-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}