{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:38:41Z","timestamp":1773931121686,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031327322","type":"print"},{"value":"9783031327339","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32733-9_21","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"482-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Energy-Efficient Distributed Algorithms for\u00a0Synchronous Networks"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Montealegre","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Rapaport","sequence":"additional","affiliation":[]},{"given":"Ioan","family":"Todinca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Augustine, J., Moses, W.K., Pandurangan, G.: Brief announcement: distributed MST computation in the sleeping model: awake-optimal algorithms and lower bounds. In: 41st ACM Symposium on Principles of Distributed Computing (PODC), pp. 51\u201353 (2022). https:\/\/doi.org\/10.1145\/3519270.3538459","DOI":"10.1145\/3519270.3538459"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Barenboim, L., Maimon, T.: Deterministic logarithmic completeness in the distributed sleeping model. In: 35th International Symposium on Distributed Computing (DISC). LIPIcs, vol. 209, pp. 10:1\u201310:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2021.10","DOI":"10.4230\/LIPIcs.DISC.2021.10"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Chang, Y., Dani, V., Hayes, T.P., He, Q., Li, W., Pettie, S.: The energy complexity of broadcast. In: 37th ACM Symposium on Principles of Distributed Computing (PODC), pp. 95\u2013104 (2018). https:\/\/doi.org\/10.1145\/3212734.3212774","DOI":"10.1145\/3212734.3212774"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Chatterjee, S., Gmyr, R., Pandurangan, G.: Sleeping is efficient: MIS in $$O$$(1)-rounds node-averaged awake complexity. In: 39th ACM Symposium on Principles of Distributed Computing (PODC), pp. 99\u2013108 (2020). https:\/\/doi.org\/10.1145\/3382734.3405718","DOI":"10.1145\/3382734.3405718"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, PODC 2014, pp. 367\u2013376. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2611462.2611493, https:\/\/doi.org\/10.1145\/2611462.2611493","DOI":"10.1145\/2611462.2611493"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Dufoulon, F., Moses, W.K., Pandurangan, G.: Sleeping is superefficient: MIS in exponentially better awake complexity (2022). https:\/\/doi.org\/10.48550\/ARXIV.2204.08359","DOI":"10.48550\/ARXIV.2204.08359"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Portmann, J.: Average awake complexity of MIS and matching. In: 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 45\u201355 (2022). https:\/\/doi.org\/10.1145\/3490148.3538566","DOI":"10.1145\/3490148.3538566"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-11409-0_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Grumbach","year":"2010","unstructured":"Grumbach, S., Wu, Z.: Logical locality entails frugal distributed computation over graphs (extended abstract). In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 154\u2013165. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_14"},{"key":"21_CR9","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0222016","volume":"22","author":"N Nisan","year":"1993","unstructured":"Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM J. Comput. 22(1), 211\u2013219 (1993). https:\/\/doi.org\/10.1137\/0222016","journal-title":"SIAM J. Comput."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32733-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:06:51Z","timestamp":1684969611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alcal\u00e1 de Henares","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2023.networks.imdea.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}