{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:26:54Z","timestamp":1777890414675,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,27]],"date-time":"2004-06-27T00:00:00Z","timestamp":1088294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,27]]},"DOI":"10.1145\/1007912.1007944","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"206-215","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":146,"title":["A scalable lock-free stack algorithm"],"prefix":"10.1145","author":[{"given":"Danny","family":"Hendler","sequence":"first","affiliation":[{"name":"Tel-Aviv University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[{"name":"Tel-Aviv University and Sun Microsystems Laboratories"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lena","family":"Yerushalmi","sequence":"additional","affiliation":[{"name":"Tel-Aviv University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/74925.74970"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80120"},{"key":"e_1_3_2_1_3_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2002","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , Second Edition. MIT Press , Cambridge, Massachusetts , 2002 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press, Cambridge, Massachusetts, 2002."},{"key":"e_1_3_2_1_4_1","volume-title":"Principles of Operation. IBM Publication No. SA22-7085","author":"I. Corporation","year":"1983","unstructured":"I. Corporation . IBM System\/370 Extended Architecture , Principles of Operation. IBM Publication No. SA22-7085 , 1983 . I. Corporation. IBM System\/370 Extended Architecture, Principles of Operation. IBM Publication No. SA22-7085, 1983."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/70082.68188"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/69624.357206"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/161468.161469"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/210223.210225"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/152864.152869"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571829"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1446"},{"key":"e_1_3_2_1_16_1","volume-title":"SOSP, Work-in-progress talk","author":"Scott M.","year":"2001","unstructured":"M. Scott and W. Schrerer . User-level spin locks for large commercial applications . In SOSP, Work-in-progress talk , 2001 . M. Scott and W. Schrerer. User-level spin locks for large commercial applications. In SOSP, Work-in-progress talk, 2001."},{"key":"e_1_3_2_1_17_1","volume-title":"Elimination trees and the construction of pools and stacks. Theory of Computing Systems, (30):645--670","author":"Shavit N.","year":"1997","unstructured":"N. Shavit and D. Touitou . Elimination trees and the construction of pools and stacks. Theory of Computing Systems, (30):645--670 , 1997 . N. Shavit and D. Touitou. Elimination trees and the construction of pools and stacks. Theory of Computing Systems, (30):645--670, 1997."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000095"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/235543.235546"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1621"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/155332.155355"}],"event":{"name":"SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004","location":"Barcelona Spain","acronym":"SPAA04","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007944","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007912.1007944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:15Z","timestamp":1750264275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,27]]},"references-count":19,"alternative-id":["10.1145\/1007912.1007944","10.1145\/1007912"],"URL":"https:\/\/doi.org\/10.1145\/1007912.1007944","relation":{},"subject":[],"published":{"date-parts":[[2004,6,27]]},"assertion":[{"value":"2004-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}