{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:24Z","timestamp":1772164044817,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":8,"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.2145868","type":"proceedings-article","created":{"date-parts":[[2012,2,28]],"date-time":"2012-02-28T07:58:45Z","timestamp":1330415925000},"page":"307-308","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["LHlf"],"prefix":"10.1145","author":[{"given":"Donghui","family":"Zhang","sequence":"first","affiliation":[{"name":"Microsoft Jim Gray Systems Lab, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Per-\u00c5ke","family":"Larson","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380230402"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Herlihy M. Luchangco V. and Moir M. 2002. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized Lock-Free Data Structures. DISC '02: 339--353.   Herlihy M. Luchangco V. and Moir M. 2002. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized Lock-Free Data Structures. DISC '02: 339--353.","DOI":"10.1007\/3-540-36108-1_23"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/42404.42410"},{"key":"e_1_3_2_1_5_1","volume-title":"VLDB '80: 212--223","author":"Litwin W.","year":"1980","unstructured":"Litwin , W. 1980 . Linear Hashing: A New Tool for File and Table Addressing , VLDB '80: 212--223 . Litwin, W. 1980. Linear Hashing: A New Tool for File and Table Addressing, VLDB '80: 212--223."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147958"}],"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.2145868","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2145816.2145868","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.2145868"}},"subtitle":["lock-free linear hashing (poster paper)"],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":8,"alternative-id":["10.1145\/2145816.2145868","10.1145\/2145816"],"URL":"https:\/\/doi.org\/10.1145\/2145816.2145868","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2370036.2145868","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"}}]}}