{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:15:48Z","timestamp":1753600548346,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"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"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2019-04852"],"award-info":[{"award-number":["RGPIN-2019-04852"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,31]]},"DOI":"10.1145\/3382734.3405736","type":"proceedings-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:33:55Z","timestamp":1596234835000},"page":"181-190","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives"],"prefix":"10.1145","author":[{"given":"David Yu Cheng","family":"Chan","sequence":"first","affiliation":[{"name":"University of Calgary, Calgary, Alberta, Canada"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, Alberta, Canada"}]}],"member":"320","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_32"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of 40th ACM STOC. 217--226","author":"Attiya Hagit","year":"2008","unstructured":"Hagit Attiya , Danny Hendler , and Philipp Woelfel . 2008 . Tight RMR Lower Bounds for Mutual Exclusion and Other Problems . In Proc. of 40th ACM STOC. 217--226 . Hagit Attiya, Danny Hendler, and Philipp Woelfel. 2008. Tight RMR Lower Bounds for Mutual Exclusion and Other Problems. In Proc. of 40th ACM STOC. 217--226."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405739"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of 21st OPODIS. 17:1--17:16","author":"Dvir Rotem","year":"2017","unstructured":"Rotem Dvir and Gadi Taubenfeld . 2017 . Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code . In Proc. of 21st OPODIS. 17:1--17:16 . Rotem Dvir and Gadi Taubenfeld. 2017. Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code. In Proc. of 21st OPODIS. 17:1--17:16."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0150-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087819"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212755"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-019-00364-0"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of 6th NETYS (LNCS)","volume":"11028","author":"Jayanti Prasad","year":"2018","unstructured":"Prasad Jayanti , Siddhartha Jayanti , and Anup Joshi . 2018 . Optimal Recoverable Mutual Exclusion Using only FASAS . In Proc. of 6th NETYS (LNCS) , Vol. 11028 . Springer, 191--206. Prasad Jayanti, Siddhartha Jayanti, and Anup Joshi. 2018. Optimal Recoverable Mutual Exclusion Using only FASAS. In Proc. of 6th NETYS (LNCS), Vol. 11028. Springer, 191--206."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331634"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of 31st DISC (LIPIcs)","volume":"91","author":"Jayanti Prasad","year":"2017","unstructured":"Prasad Jayanti and Anup Joshi . 2017 . Recoverable FCFS Mutual Exclusion with Wait-Free Recovery . In Proc. of 31st DISC (LIPIcs) , Vol. 91 . 30:1--30:15. Prasad Jayanti and Anup Joshi. 2017. Recoverable FCFS Mutual Exclusion with Wait-Free Recovery. In Proc. of 31st DISC (LIPIcs), Vol. 91. 30:1--30:15."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"volume-title":"RGLock: Recoverable mutual exclusion for non-volatile main memorysystems. Master's thesis","author":"Ramaraju Aditya","key":"e_1_3_2_1_15_1","unstructured":"Aditya Ramaraju . 2015. RGLock: Recoverable mutual exclusion for non-volatile main memorysystems. Master's thesis . University of Waterloo . https:\/\/uwspace.uwaterloo.ca\/handle\/10012\/9473 Aditya Ramaraju. 2015. RGLock: Recoverable mutual exclusion for non-volatile main memorysystems. Master's thesis. University of Waterloo. https:\/\/uwspace.uwaterloo.ca\/handle\/10012\/9473"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01784242"}],"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.3405736","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3405736","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.3405736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":15,"alternative-id":["10.1145\/3382734.3405736","10.1145\/3382734"],"URL":"https:\/\/doi.org\/10.1145\/3382734.3405736","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"}}]}}