{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T04:03:31Z","timestamp":1748059411952,"version":"3.41.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T00:00:00Z","timestamp":1744243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T00:00:00Z","timestamp":1744243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004271","name":"Sapienza Universit\u00e0 di Roma","doi-asserted-by":"publisher","award":["RM1221816C1760BF"],"award-info":[{"award-number":["RM1221816C1760BF"]}],"id":[{"id":"10.13039\/501100004271","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["KAKENHI 23K10985"],"award-info":[{"award-number":["KAKENHI 23K10985"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00446-025-00481-z","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T23:09:36Z","timestamp":1744240176000},"page":"95-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient computation in congested anonymous dynamic networks"],"prefix":"10.1007","volume":"38","author":[{"given":"Giuseppe A.","family":"Di Luna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Viglietta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,10]]},"reference":[{"issue":"5","key":"481_CR1","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)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"1","key":"481_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. SIGACT News 42(1), 82\u201396 (2011)","journal-title":"SIGACT News"},{"issue":"2","key":"481_CR3","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/3156693","volume":"61","author":"O Michail","year":"2018","unstructured":"Michail, O., Spirakis, P.G.: Elements of the theory of dynamic networks. Commun. ACM 61(2), 72 (2018)","journal-title":"Commun. ACM"},{"issue":"4","key":"481_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1142\/S0129054115500288","volume":"26","author":"A Casteigts","year":"2015","unstructured":"Casteigts, A., Flocchini, F., Mans, B., Santoro, N.: Shortest, fastest, and foremost broadcast in dynamic networks. Int. J. Found. Comput. Sci. 26(4), 499\u2013522 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"9","key":"481_CR5","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1007\/s00453-024-01250-3","volume":"86","author":"I Jahja","year":"2024","unstructured":"Jahja, I., Yu, H.: Sublinear algorithms in T-interval dynamic networks. Algorithmica 86(9), 2959\u20132996 (2024)","journal-title":"Algorithmica"},{"issue":"4","key":"481_CR6","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s00224-011-9348-1","volume":"49","author":"F Kuhn","year":"2011","unstructured":"Kuhn, F., Locher, T., Oshman, R.: Gradient clock synchronization in dynamic networks. Theory Comput. Syst. 49(4), 781\u2013816 (2011)","journal-title":"Theory Comput. Syst."},{"key":"481_CR7","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd ACM symposium on theory of computing (STOC \u201910), pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"481_CR8","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In: Proceedings of the 30th ACM symposium on principles of distributed computing (PODC \u201911), pp. 1\u201310 (2011)","DOI":"10.1145\/1993806.1993808"},{"key":"481_CR9","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proceedings of the 5th joint workshop on foundations of mobile computing (DIALM-POMC \u201905), pp. 104\u2013110 (2005)","DOI":"10.1145\/1080810.1080828"},{"issue":"8","key":"481_CR10","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1038\/s41591-020-0928-y","volume":"26","author":"T Sharma","year":"2020","unstructured":"Sharma, T., Bashir, M.: Use of apps in the COVID-19 response and the loss of privacy protection. Nat. Med. 26(8), 1165\u20131167 (2020)","journal-title":"Nat. Med."},{"issue":"3","key":"481_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00446-008-0067-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distrib. Comput. 21(3), 61\u201375 (2008)","journal-title":"Distrib. Comput."},{"key":"481_CR12","unstructured":"Aspnes, J., Beauquier, J., Burman, J., Sohier, D.: Time and space optimal counting in population protocols. in: Proceedings of the 20th International conference on principles of distributed systems (OPODIS \u201916), pp. 13\u201311317 (2016)"},{"key":"481_CR13","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Burman, J., Clavi\u00e8re, S., Sohier, D.: Space-optimal counting in population protocols. In: Proceedings of the 29th International symposium on distributed computing (DISC \u201915), pp. 631\u2013646 (2015)","DOI":"10.1007\/978-3-662-48653-5_42"},{"issue":"33","key":"481_CR14","doi-asserted-by":"publisher","first-page":"4247","DOI":"10.1016\/j.tcs.2010.09.016","volume":"412","author":"J Beauquier","year":"2011","unstructured":"Beauquier, J., Burman, J., Kutten, S.: A self-stabilizing transformer for population protocols with covering. Theoret. Comput. Sci. 412(33), 4247\u20134259 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"481_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2018.09.005","volume":"754","author":"GA Di Luna","year":"2019","unstructured":"Di Luna, G.A., Flocchini, P., Izumi, T., Izumi, T., Santoro, N., Viglietta, G.: Population protocols with faulty interactions: the impact of a leader. Theoret. Comput. Sci. 754, 35\u201349 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"481_CR16","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A., Peleg, D., P\u00e9rennes, S.: Assigning labels in unknown anonymous networks. In: Proceedings of the 19th ACM symposium on principles of distributed computing (PODC \u201900), pp. 101\u2013111 (2000)","DOI":"10.1145\/343477.343527"},{"key":"481_CR17","unstructured":"Kowalski, D.R., Mosteiro, M.A.: polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations. In: Proceedings of the 45th International colloquium on automata, languages, and programming (ICALP \u201918), pp. 156\u2013115614 (2018)"},{"issue":"2","key":"481_CR18","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/3385075","volume":"67","author":"DR Kowalski","year":"2020","unstructured":"Kowalski, D.R., Mosteiro, M.A.: Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations. J. ACM 67(2), 11\u201311117 (2020)","journal-title":"J. ACM"},{"key":"481_CR19","doi-asserted-by":"crossref","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Naming and counting in anonymous unknown dynamic networks. In: Proceedings of the 15th International symposium on stabilizing, safety, and security of distributed systems (SSS \u201913), pp. 281\u2013295 (2013)","DOI":"10.1007\/978-3-319-03089-0_20"},{"key":"481_CR20","doi-asserted-by":"crossref","unstructured":"Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: Proceedings of the 18th ACM symposium on principles of distributed computing (PODC \u201999), pp. 173\u2013179 (1999)","DOI":"10.1145\/301308.301352"},{"issue":"1","key":"481_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks. I. Characterizing the solvable cases. IEEE Trans. Parallel Distributed Syst. 7(1), 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"481_CR22","unstructured":"Kowalski, D.R., Mosteiro, M.A.: Efficient distributed computations in anonymous dynamic congested systems with opportunistic connectivity. arXiv:2202.07167 [cs.DC], 1\u201328 (2022)"},{"issue":"1","key":"481_CR23","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/060678324","volume":"48","author":"A Olshevsky","year":"2009","unstructured":"Olshevsky, A., Tsitsiklis, J.N.: Convergence speed in distributed consensus and averaging. SIAM J. Control. Optim. 48(1), 33\u201355 (2009)","journal-title":"SIAM J. Control. Optim."},{"key":"481_CR24","unstructured":"Di Luna, G.A., Viglietta, G.: Optimal computation in leaderless and multi-leader disconnected anonymous dynamic networks. In: Proceedings of the 37th International symposium on distributed computing (DISC \u201923), pp. 18\u201311820 (2023)"},{"key":"481_CR25","doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Baldoni, G.: Brief announcement: investigating the cost of anonymity on dynamic networks. In: Proceedings of the 34th Acm symposium on principles of distributed computing (PODC \u201915), pp. 339\u2013341 (2015)","DOI":"10.1145\/2767386.2767442"},{"key":"481_CR26","doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Viglietta, G.: Computing in anonymous dynamic networks is linear. In: Proceedings of the 63rd IEEE symposium on foundations of computer science (FOCS \u201922), pp. 1122\u20131133 (2022)","DOI":"10.1109\/FOCS54457.2022.00108"},{"key":"481_CR27","unstructured":"Kowalski, D.R., Mosteiro, M.A.: Polynomial anonymous dynamic distributed computing without a unique leader. In: Proceedings of the 46th International colloquium on automata, languages, and programming (ICALP \u201919), pp. 147\u2013114715 (2019)"},{"key":"481_CR28","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Mosteiro, M.A.: Supervised average consensus in anonymous dynamic networks. In: Proceedings of the 33rd ACM symposium on parallelism in algorithms and architectures (SPAA \u201921), pp. 307\u2013317 (2021)","DOI":"10.1145\/3409964.3461811"},{"key":"481_CR29","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.jcss.2021.07.002","volume":"123","author":"DR Kowalski","year":"2022","unstructured":"Kowalski, D.R., Mosteiro, M.A.: Polynomial anonymous dynamic distributed computing without a unique leader. J. Comput. Syst. Sci. 123, 37\u201363 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"481_CR30","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":"481_CR31","doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Viglietta, G.: Brief announcement: efficient computation in congested anonymous dynamic networks. In: Proceedings of the 42nd ACM symposium on principles of distributed computing(PODC \u201923), pp. 176\u2013179 (2023)","DOI":"10.1145\/3583668.3594590"},{"key":"481_CR32","unstructured":"Di Luna, G.A., Viglietta, G.: Efficient computation in congested anonymous dynamic networks. In: Proceedings of the 49th international symposium on mathematical foundations of computer science (MFCS \u201924), pp. 49\u201314919 (2024)"},{"key":"481_CR33","doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Baldoni, R., Bonomi, S., Chatzigiannakis, I.: Counting in anonymous dynamic networks under worst-case adversary. In: Proceedings of the 34th IEEE international conference on distributed computing systems (ICDCS \u201914), pp. 338\u2013347 (2014)","DOI":"10.1109\/ICDCS.2014.42"},{"key":"481_CR34","doi-asserted-by":"crossref","unstructured":"Di Luna, G.A., Bonomi, S., Chatzigiannakis, I., Baldoni, R.: Counting in anonymous dynamic networks: an experimental perspective. In: Proceedings of the 9th international symposium on algorithms and experiments for sensor systems, wireless networks and distributed robotics (ALGOSENSORS \u201913), pp. 139\u2013154 (2013)","DOI":"10.1007\/978-3-642-45346-5_11"},{"key":"481_CR35","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Inc, USA (1989)"},{"key":"481_CR36","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., Lambein-Monette, P.: Randomization and quantization for average consensus. In: Proceedings of the 57th IEEE conference on decision and control (CDC \u201918), pp. 3716\u20133721 (2018)","DOI":"10.1109\/CDC.2018.8619817"},{"key":"481_CR37","unstructured":"Charron-Bost, B., Lambein-Monette, P.: Computing outside the box: average consensus over dynamic networks. In: Proceedings of the 1st symposium on algorithmic foundations of dynamic networks (SAND \u201922), pp. 10\u201311016 (2022)"},{"issue":"4","key":"481_CR38","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1137\/100791671","volume":"49","author":"B Chazelle","year":"2011","unstructured":"Chazelle, B.: The total s-energy of a multiagent system. SIAM J. Control. Optim. 49(4), 1680\u20131706 (2011)","journal-title":"SIAM J. Control. Optim."},{"issue":"11","key":"481_CR39","doi-asserted-by":"publisher","first-page":"2506","DOI":"10.1109\/TAC.2009.2031203","volume":"54","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Olshevsky, A., Ozdaglar, A.E., Tsitsiklis, J.N.: On distributed averaging algorithms and quantization effects. IEEE Trans. Autom. Control 54(11), 2506\u20132517 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"6","key":"481_CR40","doi-asserted-by":"publisher","first-page":"3990","DOI":"10.1137\/16M1076629","volume":"55","author":"A Olshevsky","year":"2017","unstructured":"Olshevsky, A.: Linear time average consensus and distributed optimization on fixed graphs. SIAM J. Control. Optim. 55(6), 3990\u20134014 (2017)","journal-title":"SIAM J. Control. Optim."},{"issue":"11","key":"481_CR41","doi-asserted-by":"publisher","first-page":"2694","DOI":"10.1109\/TAC.2011.2159652","volume":"56","author":"A Olshevsky","year":"2011","unstructured":"Olshevsky, A., Tsitsiklis, J.N.: A lower bound for distributed averaging algorithms on the line graph. IEEE Trans. Autom. Control 56(11), 2694\u20132698 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"key":"481_CR42","unstructured":"Tsitsiklis, J.N.: Problems in decentralized decision making and computation. PhD thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science (1984)"},{"issue":"5","key":"481_CR43","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.automatica.2013.02.015","volume":"49","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Stan, G.-B., Shi, L., Barahona, M., Goncalves, J.: Decentralised minimum-time consensus. Automatica 49(5), 1227\u20131235 (2013)","journal-title":"Automatica"},{"key":"481_CR44","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: Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms (SODA \u201913), pp. 717\u2013736 (2013)","DOI":"10.1137\/1.9781611973105.52"},{"key":"481_CR45","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Kuhn, F.: Lower bounds on information dissemination in dynamic networks. In: Proceedings of the 26th international symposium on distributed computing (DISC \u201912), pp. 166\u2013180 (2012)","DOI":"10.1007\/978-3-642-33651-5_12"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00481-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-025-00481-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00481-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T11:03:34Z","timestamp":1747998214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-025-00481-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,10]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["481"],"URL":"https:\/\/doi.org\/10.1007\/s00446-025-00481-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2025,4,10]]},"assertion":[{"value":"23 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}