{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:04:15Z","timestamp":1758708255375,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1814974"],"award-info":[{"award-number":["CNS-1814974"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,2,17]]},"DOI":"10.1145\/3437801.3441614","type":"proceedings-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T23:04:20Z","timestamp":1613862260000},"page":"448-450","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Bundled references"],"prefix":"10.1145","author":[{"given":"Jacob","family":"Nelson","sequence":"first","affiliation":[{"name":"Lehigh University"}]},{"given":"Ahmed","family":"Hassan","sequence":"additional","affiliation":[{"name":"Lehigh University"}]},{"given":"Roberto","family":"Palmieri","sequence":"additional","affiliation":[{"name":"Lehigh University"}]}],"member":"320","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178489"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12142"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815406"},{"key":"e_1_3_2_1_6_1","unstructured":"Paul E McKenney and John D Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems. 509--518.  Paul E McKenney and John D Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems. 509--518."},{"key":"e_1_3_2_1_7_1","volume-title":"Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries. arXiv:cs.DS\/2012.15438 https:\/\/arxiv.org\/abs\/2012.15438","author":"Nelson Jacob","year":"2020","unstructured":"Jacob Nelson , Ahmed Hassan , and Roberto Palmieri . 2020 . Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries. arXiv:cs.DS\/2012.15438 https:\/\/arxiv.org\/abs\/2012.15438 Jacob Nelson, Ahmed Hassan, and Roberto Palmieri. 2020. Bundled References: An Abstraction for Highly-Concurrent Linearizable Range Queries. arXiv:cs.DS\/2012.15438 https:\/\/arxiv.org\/abs\/2012.15438"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067427"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735511"}],"event":{"name":"PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Virtual Event Republic of Korea","acronym":"PPoPP '21"},"container-title":["Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441614","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441614","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437801.3441614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:26Z","timestamp":1750191446000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437801.3441614"}},"subtitle":["an abstraction for highly-concurrent linearizable range queries"],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":9,"alternative-id":["10.1145\/3437801.3441614","10.1145\/3437801"],"URL":"https:\/\/doi.org\/10.1145\/3437801.3441614","relation":{},"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"2021-02-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}