{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:17Z","timestamp":1750220657568,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-1814974, CNS-1757787"],"award-info":[{"award-number":["CNS-1814974, CNS-1757787"]}],"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,1,5]]},"DOI":"10.1145\/3427796.3433932","type":"proceedings-article","created":{"date-parts":[[2020,12,25]],"date-time":"2020-12-25T22:25:45Z","timestamp":1608935145000},"page":"237-238","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On Building Modular and Elastic Data Structures with Bulk Operations"],"prefix":"10.1145","author":[{"given":"Kevin","family":"Williams","sequence":"first","affiliation":[{"name":"Lehigh University, Boston College, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Foster","sequence":"additional","affiliation":[{"name":"Lehigh University, Boston College, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athicha","family":"Srivirote","sequence":"additional","affiliation":[{"name":"Lehigh University, Boston College, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Hassan","sequence":"additional","affiliation":[{"name":"Lehigh University, Boston College, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Tassarotti","sequence":"additional","affiliation":[{"name":"Lehigh University, Boston College, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lewis","family":"Tseng","sequence":"additional","affiliation":[{"name":"Lehigh University, Boston College, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Palmieri","sequence":"additional","affiliation":[{"name":"Lehigh University, Boston College, US"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Maya Arbel-Raviv and Trevor Brown. 2018. Harnessing epoch-based reclamation for efficient range queries. In ACM SIGPLAN PPoPP. 14\u201327.  Maya Arbel-Raviv and Trevor Brown. 2018. Harnessing epoch-based reclamation for efficient range queries. In ACM SIGPLAN PPoPP. 14\u201327.","DOI":"10.1145\/3200691.3178489"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Irina Calciu Siddhartha Sen Mahesh Balakrishnan and Marcos\u00a0K. Aguilera. 2017. Black-box Concurrent Data Structures for NUMA Architectures. In ACM ASPLOS. 207\u2013221.  Irina Calciu Siddhartha Sen Mahesh Balakrishnan and Marcos\u00a0K. Aguilera. 2017. Black-box Concurrent Data Structures for NUMA Architectures. In ACM ASPLOS. 207\u2013221.","DOI":"10.1145\/3093336.3037721"},{"key":"e_1_3_2_1_3_1","volume-title":"NUMASK: High Performance Scalable Skip List for NUMA. In DISC, Vol.\u00a0121. 18:1\u201318:19.","author":"Daly Henry","year":"2018","unstructured":"Henry Daly , Ahmed Hassan , Michael\u00a0 F. Spear , and Roberto Palmieri . 2018 . NUMASK: High Performance Scalable Skip List for NUMA. In DISC, Vol.\u00a0121. 18:1\u201318:19. Henry Daly, Ahmed Hassan, Michael\u00a0F. Spear, and Roberto Palmieri. 2018. NUMASK: High Performance Scalable Skip List for NUMA. In DISC, Vol.\u00a0121. 18:1\u201318:19."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2725837"},{"key":"e_1_3_2_1_5_1","unstructured":"M. Herlihy and N. Shavit. 2008. The art of multiprocessor programming. Morgan Kaufmann.  M. Herlihy and N. Shavit. 2008. The art of multiprocessor programming. Morgan Kaufmann."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Kfir Lev-Ari Gregory\u00a0V. Chockler and Idit Keidar. 2014. On Correctness of Data Structures under Reads-Write Concurrency. In DISC(LNCS Vol.\u00a08784). 273\u2013287.  Kfir Lev-Ari Gregory\u00a0V. Chockler and Idit Keidar. 2014. On Correctness of Data Structures under Reads-Write Concurrency. In DISC(LNCS Vol.\u00a08784). 273\u2013287.","DOI":"10.1007\/978-3-662-45174-8_19"},{"key":"e_1_3_2_1_7_1","unstructured":"Paul\u00a0E McKenney and John\u00a0D Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems. 509\u2013518.  Paul\u00a0E McKenney and John\u00a0D Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems. 509\u2013518."}],"event":{"name":"ICDCN '21: International Conference on Distributed Computing and Networking 2021","acronym":"ICDCN '21","location":"Nara Japan"},"container-title":["Proceedings of the 22nd International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427796.3433932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3427796.3433932","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427796.3433932","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427796.3433932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:32Z","timestamp":1750197752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427796.3433932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":7,"alternative-id":["10.1145\/3427796.3433932","10.1145\/3427796"],"URL":"https:\/\/doi.org\/10.1145\/3427796.3433932","relation":{},"subject":[],"published":{"date-parts":[[2021,1,5]]},"assertion":[{"value":"2021-01-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}