{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T03:36:16Z","timestamp":1769657776130,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","funder":[{"name":"Greek Ministry of Education and European Union","award":["3TA-0560901"],"award-info":[{"award-number":["3TA-0560901"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,1,28]]},"DOI":"10.1145\/3774934.3786458","type":"proceedings-article","created":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T15:25:57Z","timestamp":1769613957000},"page":"123-135","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6534-8137","authenticated-orcid":false,"given":"Ajay","family":"Singh","sequence":"first","affiliation":[{"name":"ICS-FORTH, Heraklion, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6731-474X","authenticated-orcid":false,"given":"Nikos","family":"Metaxakis","sequence":"additional","affiliation":[{"name":"University of Crete, Heraklion, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6265-6895","authenticated-orcid":false,"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[{"name":"ICS-FORTH, Heraklion, Greece"},{"name":"University of Crete, Heraklion, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,1,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454060"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.OPODIS.2023.17"},{"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\/2676726.2676963"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775051.2676963"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989549"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145849"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9491-y"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.OPODIS.2017.8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508426"},{"key":"e_1_3_2_1_11_1","volume-title":"Special Issue","author":"Freudenthal Eric","year":"1991","unstructured":"Eric Freudenthal and Allan Gottlieb. 1991. Process coordination with fetch-and-increment. ACM SIGOPS Operating Systems Review, 25, Special Issue (1991), 260\u2013268."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007944"},{"key":"e_1_3_2_1_14_1","unstructured":"Maurice Herlihy Nir Shavit Victor Luchangco and Michael Spear. 2020. The art of multiprocessor programming. Newnes."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627535.3638491"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2767046"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/48022.48024"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1535\/itj.1104.05"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442527"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594565"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the ACM on Programming Languages, 8, PLDI","author":"Nikolaev Ruslan","year":"2024","unstructured":"Ruslan Nikolaev and Binoy Ravindran. 2024. A Family of Fast and Memory Efficient Lock-and Wait-Free Reclamation. Proceedings of the ACM on Programming Languages, 8, PLDI (2024), 2174\u20132198."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA \u201999)","author":"Oyama Yoshihiro","year":"1999","unstructured":"Yoshihiro Oyama, Kenjiro Taura, and Akinori Yonezawa. 1999. Executing parallel programs with synchronization bottlenecks efficiently. In Proceedings of International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA \u201999). 182\u2013204."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2770121"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3710848.3710873"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577485"},{"key":"e_1_3_2_1_27_1","volume-title":"Languages and Compilers for Parallel Computing","author":"Sagonas Konstantinos","unstructured":"Konstantinos Sagonas and Kjell Winblad. 2017. The Contention Avoiding Concurrent Priority Queue. In Languages and Compilers for Parallel Computing, Chen Ding, John Criswell, and Peng Wu (Eds.). Springer International Publishing, Cham. 314\u2013330. isbn:978-3-319-52709-3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000072"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277707"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1621"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461817"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3710848.3710890"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441625"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TPDS.2023.3335671","article-title":"Simple, fast and widely applicable concurrent memory reclamation via neutralization","volume":"35","author":"Singh Ajay","year":"2023","unstructured":"Ajay Singh, Trevor Alexander Brown, and Ali Jos\u00e9 Mashtizadeh. 2023. Simple, fast and widely applicable concurrent memory reclamation via neutralization. IEEE Transactions on Parallel and Distributed Systems, 35, 2 (2023), 203\u2013220.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_2_1_35_1","unstructured":"Ajay Singh Nikos Metaxakis and Panagiota Fatourou. 2026. Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks. arxiv:2601.04523. arxiv:2601.04523"},{"key":"e_1_3_2_1_36_1","unstructured":"R Kent Treiber et al. 1986. Systems programming: Coping with parallelism. International Business Machines Incorporated Thomas J. Watson Research \u2026."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3538532"}],"event":{"name":"PPoPP '26: 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","location":"Sydney NSW Australia","acronym":"PPoPP '26","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774934.3786458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T15:29:06Z","timestamp":1769614146000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774934.3786458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,28]]},"references-count":37,"alternative-id":["10.1145\/3774934.3786458","10.1145\/3774934"],"URL":"https:\/\/doi.org\/10.1145\/3774934.3786458","relation":{},"subject":[],"published":{"date-parts":[[2026,1,28]]},"assertion":[{"value":"2026-01-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}