{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:33:42Z","timestamp":1729611222171,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/candar.2016.0102","type":"proceedings-article","created":{"date-parts":[[2017,1,19]],"date-time":"2017-01-19T21:17:59Z","timestamp":1484860679000},"page":"559-564","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Distributed Wake-Up"],"prefix":"10.1109","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Rastislav","family":"Kralovic","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/S0304-3975(01)00395-4"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/0020-0190(90)90020-X"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/CDC.1984.272191"},{"key":"ref13","first-page":"317","article-title":"Time-message trade-offs for the weak unison problem","volume":"4","author":"israeli","year":"1997","journal-title":"Nordic Journal of Computing"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/77606.77610"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/0304-3975(89)90103-5"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/BF00979869"},{"year":"2007","author":"santoro","journal-title":"Design and Analysis of Distributed Algorithms","key":"ref17"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1137\/S0097539794276865"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/S0020-0190(98)00055-6"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1142\/S0129626491000161"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/BF01788564"},{"key":"ref5","first-page":"53","article-title":"Linear broadcasting and O(n log log n) election in unoriented hypercubes","author":"dobrev","year":"1997","journal-title":"4th International Colloquium on Structural Information and Communication Complexity (SIROCCO)"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/BF01185865"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/100216.100227"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/12.312126"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1137\/0220023"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<165::AID-NET1>3.0.CO;2-I"}],"event":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","start":{"date-parts":[[2016,11,22]]},"location":"Hiroshima, Japan","end":{"date-parts":[[2016,11,25]]}},"container-title":["2016 Fourth International Symposium on Computing and Networking (CANDAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7818132\/7818570\/07818672.pdf?arnumber=7818672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T21:42:53Z","timestamp":1506980573000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7818672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/candar.2016.0102","relation":{},"subject":[],"published":{"date-parts":[[2016,11]]}}}