{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:22:10Z","timestamp":1777965730347,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","funder":[{"name":"ISF","award":["1102\/21"],"award-info":[{"award-number":["1102\/21"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743316","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"382-396","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Study of Synchronization Methods for Concurrent Size"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3274-528X","authenticated-orcid":false,"given":"Hen","family":"Kas-Sharir","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2342-6955","authenticated-orcid":false,"given":"Gal","family":"Sela","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6353-956X","authenticated-orcid":false,"given":"Erez","family":"Petrank","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Trevor Brown. 2018. Java Lock-Free Data Structure Library. https:\/\/bitbucket.org\/trbot86\/implementations\/src\/master\/java\/src\/algorithms\/published"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Brian F Cooper Adam Silberstein Erwin Tam Raghu Ramakrishnan and Russell Sears. 2010. Benchmarking cloud serving systems with YCSB. In SoCC. https:\/\/doi.org\/10.1145\/1807128.1807152","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.174673"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158611"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/362426.362484"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Faith Ellen Panagiota Fatourou Eric Ruppert and Franck van Breugel. 2010. Nonblocking binary search trees. In PODC. https:\/\/doi.org\/10.1145\/1835698.1835736","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Maurice Herlihy. 1991. Wait-free synchronization. TOPLAS 13 1(1991). https:\/\/doi.org\/10.1145\/114005.102808","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_9_1","volume-title":"A Study of Synchronization Methods for Concurrent Size. arXiv preprint","author":"Kas-Sharir Hen","year":"2025","unstructured":"Hen Kas-Sharir, Gal Sela, and Erez Petrank. 2025. A Study of Synchronization Methods for Concurrent Size. arXiv preprint (2025). arXiv:2506.16350"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Hen Kas-Sharir Gal Sela and Erez Petrank. 2025. A Study of Synchronization Methods for Concurrent Size - Artifact for SPAA'25. https:\/\/github.com\/henkassharir\/ConcurrentSizeMethods","DOI":"10.1145\/3694906.3743316"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/504282.504309"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563300"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7079982"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:19:14Z","timestamp":1777922354000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":13,"alternative-id":["10.1145\/3694906.3743316","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743316","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}