{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:48:35Z","timestamp":1768870115866,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030549206","type":"print"},{"value":"9783030549213","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-54921-3_17","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"291-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Communication Complexity of Wait-Free Computability in Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Afek, Y., Gafni, E.: A simple characterization of asynchronous computations. Theoret. Comput. Sci. 561, 88\u201395 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.07.022. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397514005659","DOI":"10.1016\/j.tcs.2014.07.022"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02277665","volume":"5","author":"ES Amdur","year":"1992","unstructured":"Amdur, E.S., Weber, S.M., Hadzilacos, V.: On the message complexity of binary byzantine agreement under crash failures. Distrib. Comp. 5(4), 175\u2013186 (1992). https:\/\/doi.org\/10.1007\/BF02277665","journal-title":"Distrib. Comp."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O Biran","year":"1990","unstructured":"Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed 1-solvable tasks. J. Algorithms 11(3), 420\u2013440 (1990). https:\/\/doi.org\/10.1016\/0196-6774(90)90020-F","journal-title":"J. Algorithms"},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012). https:\/\/doi.org\/10.1080\/17445760.2012.668546","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2019.02.009","volume":"780","author":"A Casteigts","year":"2019","unstructured":"Casteigts, A., M\u00e9tivier, Y., Robson, J.M., Zemmari, A.: Counting in one-hop beeping networks. Theor. Comput. Sci. 780, 20\u201328 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.009","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/1326554.1326557","volume":"55","author":"Y Dinitz","year":"2008","unstructured":"Dinitz, Y., Moran, S., Rajsbaum, S.: Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55(1), 3:1\u20133:28 (2008). https:\/\/doi.org\/10.1145\/1326554.1326557","journal-title":"J. ACM"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11429647_11","volume-title":"Structural Information and Communication Complexity","author":"Y Dinitz","year":"2005","unstructured":"Dinitz, Y., Solomon, N.: Two absolute bounds for distributed bit complexity. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 115\u2013126. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11429647_11"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Fevat, T., Godard, E.: Minimal obstructions for the coordinated attack problem and beyond. In: 2011 International Parallel and Distributed Processing Symposium (IPDPS), pp. 1001\u20131011. IEEE, May 2011. https:\/\/doi.org\/10.1109\/IPDPS.2011.96","DOI":"10.1109\/IPDPS.2011.96"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539796305766","volume":"28","author":"E Gafni","year":"1999","unstructured":"Gafni, E., Koutsoupias, E.: Three-processor tasks are undecidable. SIAM J. Comput. 28(3), 970\u2013983 (1999)","journal-title":"SIAM J. Comput."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-17653-1_17","volume-title":"Principles of Distributed Systems","author":"E Gafni","year":"2010","unstructured":"Gafni, E., Rajsbaum, S.: Distributed programming with tasks. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 205\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17653-1_17"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. In: 36th Annual Foundations of Computer Science, pp. 724\u2013733. IEEE, Oct 1995. https:\/\/doi.org\/10.1109\/SFCS.1995.492674","DOI":"10.1109\/SFCS.1995.492674"},{"key":"17_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/C2011-0-07032-1","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Elsevier-Morgan Kaufmann, San Francisco (2013). https:\/\/doi.org\/10.1016\/C2011-0-07032-1"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks (extended abstract). In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 589\u2013598. ACM, New York (1997). https:\/\/doi.org\/10.1145\/258533.258652","DOI":"10.1145\/258533.258652"},{"issue":"6","key":"17_CR15","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Mostefaoui, A., Raynal, M.: Two-bit messages are sufficient to implement atomic read\/write registers in crash-prone systems. In: Principles of Distributed Computing (PODC), pp. 381\u2013389. ACM (2016). https:\/\/doi.org\/10.1145\/2933057.2933095","DOI":"10.1145\/2933057.2933095"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-030-01325-7_27","volume-title":"Structural Information and Communication Complexity","author":"D Pfleger","year":"2018","unstructured":"Pfleger, D., Schmid, U.: On knowledge and communication complexity in distributed systems. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 312\u2013330. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01325-7_27"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-12200-2_36","volume-title":"LATIN 2010: Theoretical Informatics","author":"S Rajsbaum","year":"2010","unstructured":"Rajsbaum, S.: Iterated shared memory models. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 407\u2013416. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12200-2_36"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-19533-4","volume-title":"An Invitation to Mathematics","author":"AA Razborov","year":"2011","unstructured":"Razborov, A.A.: Communication complexity. In: Dierk Schleicher, M.L. (ed.) An Invitation to Mathematics, pp. 97\u2013117. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19533-4"},{"key":"17_CR20","unstructured":"Winkler, K., Schmid, U.: An overview of recent results for consensus in directed dynamic networks. Bull. EATCS 128 (2019). http:\/\/bulletin.eatcs.org\/index.php\/beatcs\/article\/view\/581\/585"},{"issue":"5","key":"17_CR21","doi-asserted-by":"publisher","first-page":"757","DOI":"10.3390\/math8050757","volume":"8","author":"Y Yue","year":"2020","unstructured":"Yue, Y., Lei, F., Liu, X., Wu, J.: Asynchronous computability theorem in arbitrary solo models. Mathematics 8(5), 757 (2020). https:\/\/doi.org\/10.3390\/math8050757","journal-title":"Mathematics"}],"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-030-54921-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:42:31Z","timestamp":1619232151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","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":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"41","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":"19","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":"46% - 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":"11","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}