{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:18:10Z","timestamp":1743020290383,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549206"},{"type":"electronic","value":"9783030549213"}],"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_11","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"183-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Stateless Information Dissemination Algorithms"],"prefix":"10.1007","author":[{"given":"Volker","family":"Turau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"key":"11_CR1","series-title":"Series on Parallel and Distributed Computing","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing - Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.L.: Distributed Computing - Fundamentals, Simulations, and Advanced Topics. Series on Parallel and Distributed Computing, 2nd edn. Wiley, Hoboken (2004)","edition":"2"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Khandekar, R.: Stateless distributed gradient descent for positive linear programs. In: Proceedings of the 40th Symposium on Theory of Computing, pp. 691\u2013700. ACM (2008)","DOI":"10.1145\/1374376.1374476"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-13111-5_4","volume-title":"Location Science","author":"H Calik","year":"2015","unstructured":"Calik, H., Labb\u00e9, M., Yaman, H.: p-center problems. In: Laporte, G., Nickel, S., da Gama, F.S. (eds.) Location Science, pp. 79\u201392. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-13111-5_4"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Dolev, D., Erdmann, M., Lutz, N., Schapira, M., Zair, A.: Brief announcement: stateless computation. In: Schiller, E., Schwarzmann, A. (eds.) Proceedings of the Symposium on Principles of Distributed Computing, (PODC), pp. 419\u2013421. ACM (2017)","DOI":"10.1145\/3087801.3087854"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-11764-5_13","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Dolev","year":"2014","unstructured":"Dolev, S., Kahil, R.M., Yagel, R.: Stateless stabilization bootstrap (extended abstract). In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 180\u2013194. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11764-5_13"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 434\u2013444. ACM, New York (1988)","DOI":"10.1145\/62212.62255"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-52921-7_62","volume-title":"Algorithms","author":"U Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 128\u2013137. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52921-7_62"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"AM Frieze","year":"1985","unstructured":"Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10(1), 57\u201377 (1985)","journal-title":"Discrete Appl. Math."},{"key":"11_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, 1st edn. W. H. Freeman, San Francisco (1979)","edition":"1"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18(4), 319\u2013349 (1988)","journal-title":"Networks"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"WL Hsu","year":"1979","unstructured":"Hsu, W.L., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discrete Appl. Math. 1(3), 209\u2013215 (1979)","journal-title":"Discrete Appl. Math."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Hussak, W., Trehan, A.: Brief announcement: on termination of a flooding process. In: Proceedings ACM Symposium on Principles of Distributed Computing, PODC, New York, pp. 153\u2013155 (2019)","DOI":"10.1145\/3293611.3331586"},{"key":"11_CR14","unstructured":"Hussak, W., Trehan, A.: On the termination of flooding. In: Paul, C., Bl\u00e4ser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol. 154, pp. 17:1\u201317:13. Dagstuhl, Germany (2020)"},{"key":"11_CR15","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: the p-centers. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1287\/ijoc.2018.0845","volume":"32","author":"Y Mocquard","year":"2020","unstructured":"Mocquard, Y., Sericola, B., Anceaume, E.: Probabilistic analysis of rumor-spreading time. INFORMS J. Comput. 32(1), 172\u2013181 (2020)","journal-title":"INFORMS J. Comput."},{"key":"11_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"11_CR18","unstructured":"Turau, V.: Analysis of amnesiac flooding. CoRR abs\/2002.10752 (2020). https:\/\/arxiv.org\/abs\/2002.10752"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T02:40:32Z","timestamp":1619232032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}