{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:55:34Z","timestamp":1770814534853,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"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":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796885","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:18:49Z","timestamp":1655759929000},"page":"1089-1098","source":"Crossref","is-referenced-by-count":7,"title":["Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model"],"prefix":"10.1109","author":[{"given":"Evgeniy","family":"Feder","sequence":"first","affiliation":[{"name":"ITMO University,Computer Technologies,Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichha","family":"Rathod","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Department of Computer Science and Engineering,Delhi,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Punit","family":"Shyamsukha","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Department of Computer Science and Engineering,Delhi,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Sama","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Aksenov","sequence":"additional","affiliation":[{"name":"ITMO University,Computer Technologies,Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iosif","family":"Salem","sequence":"additional","affiliation":[{"name":"University of Vienna,Faculty of Computer Science,Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3310165.3310170"},{"key":"ref12","first-page":"1","article-title":"Demand-aware network designs of bounded degree","author":"avin","year":"2019","journal-title":"Distributed Computing"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34992-9_29"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.07.009"},{"key":"ref15","article-title":"New bounds for randomized list update in the paid exchange model","author":"albers","year":"2020","journal-title":"37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029563"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737417"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155495"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486031"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394205"},{"key":"ref27","article-title":"Characterization of the doe mini-apps","author":"doe","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2410313"},{"key":"ref8","first-page":"1","article-title":"Expanding across time to deliver bandwidth efficiency and low latency","author":"mellette","year":"0"},{"key":"ref7","article-title":"An online matching model for self-adjusting tor-to-tor networks","author":"avin","year":"2020","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2975159"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406221"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098838"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61792-9_12"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294261"},{"key":"ref21","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"vizing","year":"1964","journal-title":"Discr Analiz"},{"key":"ref24","year":"0"},{"key":"ref23","year":"0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"ref25","year":"0"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","location":"London, United Kingdom","start":{"date-parts":[[2022,5,2]]},"end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796885.pdf?arnumber=9796885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T20:00:46Z","timestamp":1657569646000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796885\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796885","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}