{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:10:50Z","timestamp":1784135450032,"version":"3.55.0"},"reference-count":65,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,17]]},"DOI":"10.1109\/infocom53939.2023.10228999","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T17:40:43Z","timestamp":1693330843000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree"],"prefix":"10.1109","author":[{"given":"Arash","family":"Pourdamghani","sequence":"first","affiliation":[{"name":"TU Berlin,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Avin","sequence":"additional","affiliation":[{"name":"Ben Gurion University of the Negev,School of Electrical and Computer Engineering,Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Sama","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","first-page":"587","article-title":"Consistent hashing with bounded loads","author":"mirrokni","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref57","article-title":"Expanding across time to deliver bandwidth efficiency and low latency","author":"mellette","year":"2020","journal-title":"USENIX NSDI"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461786"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3491050"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3351452.3351464"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451107"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2021.3075326"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253120"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1136-8"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3174118"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3230718.3230722"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2007.55"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.21105\/joss.03021"},{"key":"ref19","article-title":"Analysis of SHA-512\/224 and SHA-512\/256","author":"dobraunig","year":"2016","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00016"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737431"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1138-6"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155495"},{"key":"ref48","article-title":"Dynamic optimality for skip lists and b-trees","author":"bose","year":"2008","journal-title":"ACM-SIAM SODA"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1186810.1186816"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/31846.42227"},{"key":"ref41","article-title":"Huffman coding","author":"moffat","year":"2019","journal-title":"ACM CSUR"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/11940128_29"},{"key":"ref49","article-title":"Alternatives to splay trees with o(log n) worst-case access times","author":"iacono","year":"2001","journal-title":"ACM-SIAM SODA"},{"key":"ref8","article-title":"Demand-aware network designs of bounded degree","author":"avin","year":"2017","journal-title":"Disc"},{"key":"ref7","author":"borodin","year":"2005","journal-title":"Online Computation and Competitive Analysis"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2895553"},{"key":"ref3","article-title":"The programmable data plane: Abstractions, architectures, algorithms, and applications","author":"michel","year":"2021","journal-title":"ACM CSUR"},{"key":"ref6","article-title":"A survey of reconfigurable optical networks","author":"hall","year":"2021","journal-title":"OSN"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1012"},{"key":"ref35","article-title":"On the competitiveness of linear search","author":"munro","year":"2000","journal-title":"ESA"},{"key":"ref34","article-title":"Static optimality and dynamic search-optimality in lists and trees","author":"blum","year":"2002","journal-title":"ACM-SIAM SODA"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22300-6_35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.55"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90021-8"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.10.001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109600"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1672308.1672325"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3410048.3410076"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90036-7"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40273-9_16"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00142-Y"},{"key":"ref23","article-title":"New bounds for randomized list update in the paid exchange model","author":"albers","year":"2020","journal-title":"STACS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294261"},{"key":"ref25","article-title":"A new family of randomized algorithms for list accessing","author":"garefalakis","year":"1997","journal-title":"ESA"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737417"},{"key":"ref22","article-title":"A survey of algorithms and models for list update","author":"kamali","year":"2013","journal-title":"LNTCST"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58338-6_67"},{"key":"ref65","article-title":"Improving load balancing with a new consistent-hashing algorithm","author":"rodland","year":"2016","journal-title":"vimeo Engineering Blog Medium"},{"key":"ref28","author":"lucas","year":"1988","journal-title":"Canonical forms for competitive binary search tree algorithms"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_9"},{"key":"ref29","article-title":"Dynamic optimality - almost","author":"demaine","year":"2004","journal-title":"IEEE FOCS"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796885"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.3"},{"key":"ref61","article-title":"Toward demand-aware networking: a theory for self-adjusting networks","author":"avin","year":"2018","journal-title":"ACM SIGCOMM CCR"}],"event":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications","location":"New York City, NY, USA","start":{"date-parts":[[2023,5,17]]},"end":{"date-parts":[[2023,5,20]]}},"container-title":["IEEE INFOCOM 2023 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10228851\/10228852\/10228999.pdf?arnumber=10228999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:44:00Z","timestamp":1695059040000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10228999\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,17]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/infocom53939.2023.10228999","relation":{},"subject":[],"published":{"date-parts":[[2023,5,17]]}}}