{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:44Z","timestamp":1772164004687,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,24]],"date-time":"2016-01-24T00:00:00Z","timestamp":1453593600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["ER26116\/DE-SC0008923"],"award-info":[{"award-number":["ER26116\/DE-SC0008923"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004682","name":"Oracle","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004682","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1217921, CCF-1301926, and IIS-1447786"],"award-info":[{"award-number":["CCF-1217921, CCF-1301926, and IIS-1447786"]}],"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":[[2015,1,24]]},"DOI":"10.1145\/2688500.2688523","type":"proceedings-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T09:12:26Z","timestamp":1422436346000},"page":"11-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":60,"title":["The SprayList: a scalable relaxed priority queue"],"prefix":"10.1145","author":[{"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[{"name":"Microsoft Research, UK"}]},{"given":"Justin","family":"Kopinsky","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Jerry","family":"Li","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA \/ Tel Aviv University, Israel"}]}],"member":"320","published-online":{"date-parts":[[2015,1,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/snap.stanford. edu\/data\/index.html. Accessed","author":"Stanford","year":"2014","unstructured":"Stanford large network dataset collection. http:\/\/snap.stanford. edu\/data\/index.html. Accessed: Sept. 2014."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0185-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.66"},{"key":"e_1_3_2_1_4_1","unstructured":"D. Alistarh J. Kopinsky J. Li and N. Shavit. Spraylist. https: \/\/github.com\/jkopinsky\/SprayList."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"D. Alistarh J. Kopinsky J. Li and N. Shavit. The spraylist: A scalable relaxed priority queue. Technical Report MSR-TR-2014-16 December 2014.","DOI":"10.1145\/2688500.2688523"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2075029.2075087"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312016"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1425"},{"key":"e_1_3_2_1_9_1","volume-title":"Aug.","author":"Calciu I.","year":"2014","unstructured":"I. Calciu, H. Mendes, and M. Herlihy. The Adaptive Priority Queue with Elimination and Combining. ArXiv e-prints, Aug. 2014."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145837"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00128644"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486182"},{"key":"e_1_3_2_1_13_1","volume-title":"Urdme: a modular framework for stochastic simulation of reaction-transport processes in complex geometries. BMC Systems Biology, 6(76)","author":"Drawert B.","year":"2012","unstructured":"B. Drawert, S. Engblom, and A. Hellander. Urdme: a modular framework for stochastic simulation of reaction-transport processes in complex geometries. BMC Systems Biology, 6(76), 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/08072646X"},{"key":"e_1_3_2_1_15_1","unstructured":"K. Fraser. Practical lock-freedom. PhD thesis PhD thesis Cambridge University Computer Laboratory 2003. Also available as Technical Report UCAM-CL-TR-579 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429109"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1734069"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_24"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174145"},{"key":"e_1_3_2_1_20_1","volume-title":"Introduction to algorithms","author":"Leiserson C. E.","year":"2001","unstructured":"C. E. Leiserson, R. L. Rivest, C. Stein, and T. H. Cormen. Introduction to algorithms. The MIT press, 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03850-6_15"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/846234.849296"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_25_1","volume-title":"Concurrent maintenance of skip lists","author":"Pugh W.","year":"1998","unstructured":"W. Pugh. Concurrent maintenance of skip lists. 1998."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1429"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1897852.1897873"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.12.005"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555278"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688547"}],"event":{"name":"PPoPP '15: 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Francisco CA USA","acronym":"PPoPP '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688500.2688523","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688500.2688523","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688500.2688523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:40:30Z","timestamp":1763458830000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688500.2688523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,24]]},"references-count":30,"alternative-id":["10.1145\/2688500.2688523","10.1145\/2688500"],"URL":"https:\/\/doi.org\/10.1145\/2688500.2688523","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2858788.2688523","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,1,24]]},"assertion":[{"value":"2015-01-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}