{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:54Z","timestamp":1750220334233,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"IDEX-Universit\u00e9 Paris Cit\u00e9","award":["BAD"],"award-info":[{"award-number":["BAD"]}]},{"name":"Marie Sklodowska-Curie","award":["PLATON (GA No 101031688)"],"award-info":[{"award-number":["PLATON (GA No 101031688)"]}]},{"name":"HFRI","award":["3684"],"award-info":[{"award-number":["3684"]}]},{"name":"NSERC"},{"name":"ANR DUCAT","award":["-20-EC48-0006"],"award-info":[{"award-number":["-20-EC48-0006"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538418","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"198-208","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["When is Recoverable Consensus Harder Than Consensus?"],"prefix":"10.1145","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris Cit\u00e9, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Cit\u00e9; FORTH ICS; & University of Crete, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Cit\u00e9, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Ruppert","sequence":"additional","affiliation":[{"name":"York University, Toronto, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508444"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212753"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374506"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323187"},{"key":"e_1_3_2_2_6_1","first-page":"1","volume-title":"Proc. 19th International Conference on Principles of Distributed Systems","volume":"46","author":"Berryhill Ryan","year":"2015","unstructured":"Ryan Berryhill , Wojciech M. Golab , and Mahesh Tripunitara . Robust shared objects for non-volatile main memory . In Proc. 19th International Conference on Principles of Distributed Systems , volume 46 of LIPIcs, pages 20: 1 -- 20 :17, 2015 . Ryan Berryhill, Wojciech M. Golab, and Mahesh Tripunitara. Robust shared objects for non-volatile main memory. In Proc. 19th International Conference on Principles of Distributed Systems, volume 46 of LIPIcs, pages 20:1--20:17, 2015."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2714064.2660224"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950380"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210400"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210392"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387515"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374523"},{"key":"e_1_3_2_2_13_1","volume-title":"When is recoverable consensus harder than consensus? Full version available from https:\/\/arxiv.org\/abs\/2205.14213","author":"Delporte-Gallet Carole","year":"2022","unstructured":"Carole Delporte-Gallet , Panagiota Fatourou , Hugues Fauconnier , and Eric Ruppert . When is recoverable consensus harder than consensus? Full version available from https:\/\/arxiv.org\/abs\/2205.14213 , 2022 . Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, and Eric Ruppert. When is recoverable consensus harder than consensus? Full version available from https:\/\/arxiv.org\/abs\/2205.14213, 2022."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9491-y"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508426"},{"key":"e_1_3_2_2_16_1","volume-title":"Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2--3):121--163","author":"Fich Faith","year":"2003","unstructured":"Faith Fich and Eric Ruppert . Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2--3):121--163 , 2003 . Faith Fich and Eric Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2--3):121--163, 2003."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386031"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454105"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400212"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212755"},{"key":"e_1_3_2_2_22_1","first-page":"211","volume-title":"Proc. ACM Symposium on Principles of Distributed Computing","author":"Wojciech","year":"2017","unstructured":"Wojciech M. Golab and Danny Hendler. Recoverable mutual exclusion in sub-logarithmic time . In Proc. ACM Symposium on Principles of Distributed Computing , pages 211 -- 220 , 2017 . Wojciech M. Golab and Danny Hendler. Recoverable mutual exclusion in sub-logarithmic time. In Proc. ACM Symposium on Principles of Distributed Computing, pages 211--220, 2017."},{"key":"e_1_3_2_2_23_1","first-page":"65","volume-title":"Proc. ACM Symposium on Principles of Distributed Computing","author":"Wojciech","year":"2016","unstructured":"Wojciech M. Golab and Aditya Ramaraju. Recoverable mutual exclusion . In Proc. ACM Symposium on Principles of Distributed Computing , pages 65 -- 74 , 2016 . Wojciech M. Golab and Aditya Ramaraju. Recoverable mutual exclusion. In Proc. ACM Symposium on Principles of Distributed Computing, pages 65--74, 2016."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2004.1281605"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_23"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263888"},{"key":"e_1_3_2_2_28_1","first-page":"121","article-title":"\u00dcber eine Schlussweise aus dem Endlichen ins Unendliche. Acta Litterarum ac Scientiarum Regiae Universitatis Hungaricae Francisco-Josephinae","volume":"3","author":"K\u00f6nig D\u00e9nes","year":"1927","unstructured":"D\u00e9nes K\u00f6nig . \u00dcber eine Schlussweise aus dem Endlichen ins Unendliche. Acta Litterarum ac Scientiarum Regiae Universitatis Hungaricae Francisco-Josephinae : Sectio Scientiarum Mathematicarum , 3 : 121 -- 130 , 1927 . The required result also appears as Theorem 3 in chapter VI of K\u00f6nig's Theory of Finite and Infinite Graphs, Birkh\u00e4user, Boston, 1990. D\u00e9nes K\u00f6nig. \u00dcber eine Schlussweise aus dem Endlichen ins Unendliche. Acta Litterarum ac Scientiarum Regiae Universitatis Hungaricae Francisco-Josephinae: Sectio Scientiarum Mathematicarum, 3:121--130, 1927. The required result also appears as Theorem 3 in chapter VI of K\u00f6nig's Theory of Finite and Infinite Graphs, Birkh\u00e4user, Boston, 1990.","journal-title":"Sectio Scientiarum Mathematicarum"},{"key":"e_1_3_2_2_29_1","volume-title":"Detectable data structures for persistent memory. Master's thesis","author":"Li Nan","year":"2021","unstructured":"Nan Li . Detectable data structures for persistent memory. Master's thesis , University of Waterloo , 2021 . Available from https:\/\/uwspace.uwaterloo.ca\/handle\/10012\/16986. Nan Li. Detectable data structures for persistent memory. Master's thesis, University of Waterloo, 2021. Available from https:\/\/uwspace.uwaterloo.ca\/handle\/10012\/16986."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798335766"},{"key":"e_1_3_2_2_31_1","first-page":"100","volume-title":"Proc. 14th ACM Symposium on Principles of Distributed Computing","author":"Neiger Gil","year":"1995","unstructured":"Gil Neiger . Failure detectors and the wait-free hierarchy . In Proc. 14th ACM Symposium on Principles of Distributed Computing , pages 100 -- 109 , 1995 . Gil Neiger. Failure detectors and the wait-free hierarchy. In Proc. 14th ACM Symposium on Principles of Distributed Computing, pages 100--109, 1995."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00028"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797329439"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961296.1950379"}],"event":{"name":"PODC '22: 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":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538418","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":33,"alternative-id":["10.1145\/3519270.3538418","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538418","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}