{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:12Z","timestamp":1750220832738,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ontario Early Researcher Award"},{"name":"Google Faculty Research Award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400212","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"281-291","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["The Recoverable Consensus Hierarchy"],"prefix":"10.1145","author":[{"given":"Wojciech","family":"Golab","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0023-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164071"},{"key":"e_1_3_2_1_3_1","volume-title":"Technical Report HPL-2003--241. Hewlett-Packard Labs.","author":"Aguilera Marcos K.","year":"2003","unstructured":"Marcos K. Aguilera and S. Fr\u00f8lund . 2003 . Strict linearizability and the power of aborting. Technical Report HPL-2003--241. Hewlett-Packard Labs. Marcos K. Aguilera and S. Fr\u00f8lund. 2003. Strict linearizability and the power of aborting. Technical Report HPL-2003--241. Hewlett-Packard Labs."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591836"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212753"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. of the 19th International Conference on Principles of Distributed Systems (OPODIS). 31:1--31:16","author":"Attiya Hagit","year":"2015","unstructured":"Hagit Attiya , Armando Castaneda , and Danny Hendler . 2015 . Nontrivial and Universal Helping for Wait-Free Queues and Stacks . In Proc. of the 19th International Conference on Principles of Distributed Systems (OPODIS). 31:1--31:16 . Hagit Attiya, Armando Castaneda, and Danny Hendler. 2015. Nontrivial and Universal Helping for Wait-Free Queues and Stacks. In Proc. of the 19th International Conference on Principles of Distributed Systems (OPODIS). 31:1--31:16."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/165231.165265"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of the 19th International Conference on Principles of Distributed Systems (OPODIS). 20:1--20:17","author":"Berryhill Ryan","year":"2016","unstructured":"Ryan Berryhill , Wojciech Golab , and Mahesh Tripunitara . 2016 . Robust Shared Objects for Non-Volatile Main Memory . In Proc. of the 19th International Conference on Principles of Distributed Systems (OPODIS). 20:1--20:17 . Ryan Berryhill, Wojciech Golab, and Mahesh Tripunitara. 2016. Robust Shared Objects for Non-Volatile Main Memory. In Proc. of the 19th International Conference on Principles of Distributed Systems (OPODIS). 20:1--20:17."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767415"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30186-8_10"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332457"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933113"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of the 19th International Symposium on Distributed Computing (DISC). 78--92","author":"Ellen Faith","year":"2005","unstructured":"Faith Ellen , Victor Luchangco , Mark Moir , and Nir Shavit . 2005 . Obstruction-Free Algorithms Can Be Practically Wait-free . In Proc. of the 19th International Symposium on Distributed Computing (DISC). 78--92 . Faith Ellen, Victor Luchangco, Mark Moir, and Nir Shavit. 2005. Obstruction-Free Algorithms Can Be Practically Wait-free. In Proc. of the 19th International Symposium on Distributed Computing (DISC). 78--92."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989549"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_16_1","volume-title":"Recoverable Consensus in Shared Memory. CoRR","author":"Golab Wojciech","year":"2018","unstructured":"Wojciech Golab . 2018. Recoverable Consensus in Shared Memory. CoRR , Vol. abs\/ 1804 .10597 ( 2018 ). Wojciech Golab. 2018. Recoverable Consensus in Shared Memory. CoRR, Vol. abs\/1804.10597 (2018)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087819"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933087"},{"volume-title":"Proc. of the 24th International Conference on Distributed Computing Systems (ICDCS). 400--407","author":"Guerraoui Rachid","key":"e_1_3_2_1_19_1","unstructured":"Rachid Guerraoui and Ron R. Levy . 2004. Robust Emulations of Shared Memory in a Crash-Recovery Model . In Proc. of the 24th International Conference on Distributed Computing Systems (ICDCS). 400--407 . Rachid Guerraoui and Ron R. Levy. 2004. Robust Emulations of Shared Memory in a Crash-Recovery Model. In Proc. of the 24th International Conference on Distributed Computing Systems (ICDCS). 400--407."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"volume-title":"Proc. of the 30th International Symposium on Distributed Computing (DISC). 313--327","author":"Izraelevitz Joseph","key":"e_1_3_2_1_22_1","unstructured":"Joseph Izraelevitz , Hammurabi Mendes , and Michael L. Scott . 2016. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model . In Proc. of the 30th International Symposium on Distributed Computing (DISC). 313--327 . Joseph Izraelevitz, Hammurabi Mendes, and Michael L. Scott. 2016. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. In Proc. of the 30th International Symposium on Distributed Computing (DISC). 313--327."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA264351"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277731"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of the 31th International Symposium on Distributed Computing (DISC). 30:1--30:15","author":"Jayanti Prasad","year":"2017","unstructured":"Prasad Jayanti and Anup Joshi . 2017 . Recoverable FCFS mutual exclusion with wait-free recovery . In Proc. of the 31th International Symposium on Distributed Computing (DISC). 30:1--30:15 . Prasad Jayanti and Anup Joshi. 2017. Recoverable FCFS mutual exclusion with wait-free recovery. In Proc. of the 31th International Symposium on Distributed Computing (DISC). 30:1--30:15."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145835"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258651"},{"key":"e_1_3_2_1_28_1","volume-title":"Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing research","author":"Loui Michael C","year":"1987","unstructured":"Michael C Loui and Hosame H Abu-Amara . 1987. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing research , Vol. 4 , 163--183 ( 1987 ), 31. Michael C Loui and Hosame H Abu-Amara. 1987. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing research, Vol. 4, 163--183 (1987), 31."},{"key":"e_1_3_2_1_29_1","unstructured":"Nancy Lynch. 1996. Distributed Algorithms. Morgan Kaufman.  Nancy Lynch. 1996. Distributed Algorithms. Morgan Kaufman."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555261"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400212","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:34Z","timestamp":1750202014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":30,"alternative-id":["10.1145\/3350755.3400212","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400212","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}