{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:11:17Z","timestamp":1730275877155,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,28]]},"DOI":"10.1109\/ispdc52870.2021.9521630","type":"proceedings-article","created":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T21:02:52Z","timestamp":1630011772000},"page":"9-16","source":"Crossref","is-referenced-by-count":0,"title":["Towards an Elastic Lock-Free Hash Trie Design"],"prefix":"10.1109","author":[{"given":"Miguel","family":"Areias","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/0022-0000(86)90021-8"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/2656332"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/1147954.1147958"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/BDCloud.2018.00070"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/367390.367400"},{"key":"ref5","article-title":"Techniques for Constructing Efficient Lock-free Data Structures","author":"brown","year":"2017","journal-title":"Ph D Dissertation"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/2145816.2145836"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/564879.564881"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/3-540-45414-4_21"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1201\/9781420035179"},{"key":"ref9","article-title":"A Provably Correct Scalable Concurrent Skip List","author":"herlihy","year":"2006","journal-title":"International Conference on Principles of Distributed Systems Technical Report"},{"key":"ref1","article-title":"Ideal Hash Trees","volume":"1195","author":"bagwell","year":"2001","journal-title":"Es Grands Champs"}],"event":{"name":"2021 20th International Symposium on Parallel and Distributed Computing (ISPDC)","start":{"date-parts":[[2021,7,28]]},"location":"Cluj-Napoca, Romania","end":{"date-parts":[[2021,7,30]]}},"container-title":["2021 20th International Symposium on Parallel and Distributed Computing (ISPDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9521547\/9521595\/09521630.pdf?arnumber=9521630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:45:21Z","timestamp":1652197521000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9521630\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,28]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ispdc52870.2021.9521630","relation":{},"subject":[],"published":{"date-parts":[[2021,7,28]]}}}