{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:40:05Z","timestamp":1755880805747,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google Faculty Research Award"},{"name":"NSERC"},{"name":"Ontario Early Researcher Award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3660272","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"73-75","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: A Fast Scalable Detectable Unrolled Lock-Based Linked List"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3700-2301","authenticated-orcid":false,"given":"Ahmed","family":"Fahmy","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8891-256X","authenticated-orcid":false,"given":"Wojciech","family":"Golab","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Marcos K. Aguilera and Svend Fr\u00f8lund. 2003. Strict Linearizability and the Power of Aborting. Technical Report Technical Report HPL-2003--241."},{"key":"e_1_3_2_1_2_1","volume-title":"Delay-Free Concurrency on Faulty Persistent Memory. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264","author":"Ben-David Naama","year":"2019","unstructured":"Naama Ben-David, Guy E. Blelloch, Michal Friedman, and Yuanhao Wei. 2019. Delay-Free Concurrency on Faulty Persistent Memory. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210392"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Steve Heller Maurice Herlihy Victor Luchangco Mark Moir William N. Scherer and Nir Shavit. 2006. A Lazy Concurrent List-Based Set Algorithm. In Principles of Distributed Systems. 3--16.","DOI":"10.1007\/11795490_3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2019.11.005"},{"key":"e_1_3_2_1_8_1","volume-title":"OneFile: A Wait-Free Persistent Transactional Memory. In 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN). 151--163","author":"Ramalhete Pedro","year":"2019","unstructured":"Pedro Ramalhete, Andreia Correia, Pascal Felber, and Nachshon Cohen. 2019. OneFile: A Wait-Free Persistent Transactional Memory. In 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN). 151--163."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91081-5_38"},{"volume-title":"Proc. of the 1994 ACM Conference on LISP and Functional Programming. 185--195","author":"Shao Zhong","key":"e_1_3_2_1_10_1","unstructured":"Zhong Shao, John H. Reppy, and Andrew W. Appel. 1994. Unrolling lists. In Proc. of the 1994 ACM Conference on LISP and Functional Programming. 185--195. io"}],"event":{"name":"SPAA '24: 36th 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":"Nantes France","acronym":"SPAA '24"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3660272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:22:51Z","timestamp":1755879771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":10,"alternative-id":["10.1145\/3626183.3660272","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3660272","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}