{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:15Z","timestamp":1772164035976,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T00:00:00Z","timestamp":1330128000000},"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":[[2012,2,25]]},"DOI":"10.1145\/2145816.2145876","type":"proceedings-article","created":{"date-parts":[[2012,2,28]],"date-time":"2012-02-28T07:58:45Z","timestamp":1330415925000},"page":"323-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A lock-free, array-based priority queue"],"prefix":"10.1145","author":[{"given":"Yujie","family":"Liu","sequence":"first","affiliation":[{"name":"Lehigh University, Bethlehem, PA, USA"}]},{"given":"Michael","family":"Spear","sequence":"additional","affiliation":[{"name":"Lehigh University, Bethlehem, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"2001","unstructured":"T. Cormen , C. Leiserson , R. Rivest , and C. Stein . Introduction to Algorithms , 2 nd edition. MIT Press and McGraw-Hill Book Company , 2001 . T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms, 2nd edition. MIT Press and McGraw-Hill Book Company, 2001.","edition":"2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645959.676137"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00148-2"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 14th International Parallel and Distributed Processing Symposium","author":"Lotan I.","year":"2000","unstructured":"I. Lotan and N. Shavit . Skiplist-Based Concurrent Priority Queues . In Proceedings of the 14th International Parallel and Distributed Processing Symposium , Cancun, Mexico , May 2000 . I. Lotan and N. Shavit. Skiplist-Based Concurrent Priority Queues. In Proceedings of the 14th International Parallel and Distributed Processing Symposium, Cancun, Mexico, May 2000."}],"event":{"name":"PPoPP '12: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"New Orleans Louisiana USA","acronym":"PPoPP '12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2145816.2145876","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2145816.2145876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:54:52Z","timestamp":1750226092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2145816.2145876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":5,"alternative-id":["10.1145\/2145816.2145876","10.1145\/2145816"],"URL":"https:\/\/doi.org\/10.1145\/2145816.2145876","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2370036.2145876","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,2,25]]},"assertion":[{"value":"2012-02-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}