{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:20:50Z","timestamp":1759134050917},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/hpec.2014.7040975","type":"proceedings-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T19:50:25Z","timestamp":1424202625000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Lockless hash tables with low false negatives"],"prefix":"10.1109","author":[{"given":"J.","family":"Ros-Giralt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Commike","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Rotsted","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Clancy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Lethin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/2465808.2465811"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00112-7"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147958"},{"key":"12","article-title":"A lock-free wait-free hash table","author":"click","year":"2008","journal-title":"Work Presented As Invited Speaker at Stanford"},{"key":"3","article-title":"Balanced allocations","author":"azar","year":"1994","journal-title":"Symposium on Theory of Computing"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"1","first-page":"253","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/564879.564881"},{"key":"7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1095890.1095904","article-title":"Segmented hash","author":"kumar","year":"2005","journal-title":"2005 Symposium on Architectures for Networking and Communications Systems (ANCS) ANCS"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/296502.296503"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916641"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814585"},{"key":"9","article-title":"A pragmatic implementation of non-blocking linked-lists","author":"harris","year":"2001","journal-title":"International Conference on Distributed Computing Systems"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080114"}],"event":{"name":"2014 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2014,9,9]]},"location":"Waltham, MA, USA","end":{"date-parts":[[2014,9,11]]}},"container-title":["2014 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7027306\/7040940\/07040975.pdf?arnumber=7040975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T05:43:56Z","timestamp":1498196636000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7040975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/hpec.2014.7040975","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}