{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:39:48Z","timestamp":1725536388471},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/iscc.2018.8538706","type":"proceedings-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T01:49:31Z","timestamp":1542678571000},"page":"00341-00346","source":"Crossref","is-referenced-by-count":1,"title":["Ballistic Skip Graph: A Skip Graph-Style Constant-Degree Structured Overlay"],"prefix":"10.1109","author":[{"given":"Yusuke","family":"Aoki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaaki","family":"Ohnishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuyuki","family":"Shudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"308","article-title":"Family Trees: An Ordered Dictionary with Optimal Congestion, Locality, Degree, and Search Time","author":"zatloukal","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_9"},{"journal-title":"Overlay Weaver","year":"2006","author":"shudo","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109601"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2015.7328521"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290674"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.08.002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"}],"event":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2018,6,25]]},"location":"Natal","end":{"date-parts":[[2018,6,28]]}},"container-title":["2018 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8510755\/8538441\/08538706.pdf?arnumber=8538706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T04:51:47Z","timestamp":1643259107000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8538706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/iscc.2018.8538706","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}