{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T14:55:39Z","timestamp":1763477739050,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910136"},{"type":"electronic","value":"9783030910143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91014-3_6","type":"book-chapter","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:03:39Z","timestamp":1638353019000},"page":"88-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weak Amnesiac Flooding of Multiple Messages"],"prefix":"10.1007","author":[{"given":"Zahra","family":"Bayramzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay D.","family":"Kshemkalyani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anisur Rahaman","family":"Molla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, M., Kuhn, F., Kutten, S., Molla, A.R., Pandurangan, G.: The communication cost of information spreading in dynamic networks. In: Proceedings of 39th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 368\u2013378 (2019)","DOI":"10.1109\/ICDCS.2019.00044"},{"key":"6_CR2","series-title":"Wiley 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. Wiley Series on Parallel and Distributed Computing, 2nd edn. Wiley, Hoboken (2004)","edition":"2"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Borokhovich, M., Avin, C., Lotker, Z.: Tight bounds for algebraic gossip on graphs. In: IEEE International Symposium on Information Theory, ISIT 2010, Austin, Texas, USA, 13\u201318 June 2010, Proceedings, pp. 1758\u20131762 (2010)","DOI":"10.1109\/ISIT.2010.5513272"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"SP Boyd","year":"2006","unstructured":"Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508\u20132530 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/100793104","volume":"41","author":"J Chen","year":"2012","unstructured":"Chen, J., Pandurangan, G.: Almost-optimal gossip-based aggregate computation. SIAM J. Comput. 41(3), 455\u2013483 (2012)","journal-title":"SIAM J. Comput."},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC \u201911, pp. 21\u201330. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1993636.1993640","DOI":"10.1145\/1993636.1993640"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: SODA, pp. 717\u2013736 (2013)","DOI":"10.1137\/1.9781611973105.52"},{"key":"6_CR8","unstructured":"Els\u00e4sser, R., Sauerwald, T.: The power of memory in randomized broadcasting. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 218\u2013227 (2008)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Li, J.: Improved distributed algorithms for exact shortest paths. In: STOC, pp. 431\u2013444 (2018)","DOI":"10.1145\/3188745.3188948"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Holzer, S., Wattenhofer, R.: Optimal distributed all pairs shortest paths and applications. In: PODC, pp. 355\u2013364 (2012)","DOI":"10.1145\/2332432.2332504"},{"key":"6_CR11","unstructured":"Hussak, W., Trehan, A.: On the termination of flooding. In: STACS, pp. 17:1\u201317:13 (2020)"},{"key":"6_CR12","unstructured":"Hussak, W., Trehan, A.: Terminating cases of flooding. CoRR abs\/2009.05776 (2020). https:\/\/arxiv.org\/abs\/2009.05776"},{"key":"6_CR13","volume-title":"Distributed Computing: Principles, Algorithms, and Systems","author":"AD Kshemkalyani","year":"2011","unstructured":"Kshemkalyani, A.D., Singhal, M.: Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, Cambridge (2011)"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: On the complexity of universal leader election. J. ACM 62(1), 7:1\u20137:27 (2015). https:\/\/doi.org\/10.1145\/2699440","DOI":"10.1145\/2699440"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: Sublinear bounds for randomized leader election. Theor. Comput. Sci. 561, 134\u2013143 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.02.009","DOI":"10.1016\/j.tcs.2014.02.009"},{"key":"6_CR16","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)"},{"key":"6_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. Society for Industrial and Applied Mathematics, USA (2000)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Rahman, A., Olesinski, W., Gburzynski, P.: Controlled flooding in wireless ad-hoc networks. In: International Workshop on Wireless Ad-Hoc Networks, pp. 73\u201378 (2004)","DOI":"10.1109\/IWWAN.2004.1525544"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2015.02.044","volume":"581","author":"AD Sarma","year":"2015","unstructured":"Sarma, A.D., Molla, A.R., Pandurangan, G.: Distributed computation in dynamic networks via random walks. Theor. Comput. Sci. 581, 45\u201366 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR20","volume-title":"Computer Networks","author":"AS Tanenbaum","year":"2010","unstructured":"Tanenbaum, A.S., Wetherall, D.J.: Computer Networks, 5th edn. Prentice Hall Press, Hoboken (2010)","edition":"5"},{"key":"6_CR21","volume-title":"Introduction to Distributed Algorithms","author":"G Tel","year":"2001","unstructured":"Tel, G.: Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"10","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/TSE.1985.231858","volume":"11","author":"DM Topkis","year":"1985","unstructured":"Topkis, D.M.: Concurrent broadcast for information dissemination. IEEE Trans. Softw. Eng. 11(10), 1107\u20131112 (1985)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"6_CR23","unstructured":"Turau, V.: Analysis of amnesiac flooding. CoRR abs\/2002.10752 (2020). https:\/\/arxiv.org\/abs\/2002.10752"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-54921-3_11","volume-title":"Structural Information and Communication Complexity","author":"V Turau","year":"2020","unstructured":"Turau, V.: Stateless information dissemination algorithms. In: Richa, A.W., Scheideler, C. (eds.) SIROCCO 2020. LNCS, vol. 12156, pp. 183\u2013199. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54921-3_11"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-67731-2_5","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"V Turau","year":"2021","unstructured":"Turau, V., et al.: Amnesiac flooding: synchronous stateless information dissemination. In: Bure\u0161, T. (ed.) SOFSEM 2021. LNCS, vol. 12607, pp. 59\u201373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_5"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91014-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T12:39:21Z","timestamp":1726231161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91014-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910136","9783030910143"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91014-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","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":"32","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":"15","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":"2","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":"47% - 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":"2,84","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}