{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:03:10Z","timestamp":1783576990064,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Polish National Science Center NCN","award":["UMO- 2017\/25\/B\/ST6\/02553"],"award-info":[{"award-number":["UMO- 2017\/25\/B\/ST6\/02553"]}]},{"name":"Pace University","award":["SR & Kenan Fund"],"award-info":[{"award-number":["SR & Kenan Fund"]}]},{"name":"NSF","award":["2043302"],"award-info":[{"award-number":["2043302"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461811","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"307-317","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Supervised Average Consensus in Anonymous Dynamic Networks"],"prefix":"10.1145","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[{"name":"Augusta University & SWPS University, Augusta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[{"name":"Pace University, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Distributed computing: fundamentals, simulations, and advanced topics","author":"Attiya Hagit","unstructured":"Hagit Attiya and Jennifer Welch . 2004. Distributed computing: fundamentals, simulations, and advanced topics . Vol. 19 . John Wiley & Sons . Hagit Attiya and Jennifer Welch. 2004. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons."},{"key":"e_1_3_2_1_3_1","volume-title":"Automata, languages and programming","author":"Avin Chen","unstructured":"Chen Avin , Michal Kouck\u1ef3 , and Zvi Lotker . 2008. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs) . In Automata, languages and programming . Springer , 121--132. Chen Avin, Michal Kouck\u1ef3, and Zvi Lotker. 2008. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In Automata, languages and programming . Springer, 121--132."},{"key":"e_1_3_2_1_4_1","unstructured":"Roberto Baldoni and Giuseppe A Di Luna. 2016. Counting on Anonymous Dynamic Networks: Bounds and Algorithms. (2016). manuscript.  Roberto Baldoni and Giuseppe A Di Luna. 2016. Counting on Anonymous Dynamic Networks: Bounds and Algorithms. (2016). manuscript."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2316801"},{"key":"e_1_3_2_1_6_1","volume-title":"Emergence of scaling in random networks. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. science , Vol. 286 , 5439 ( 1999 ), 509--512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science , Vol. 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1323937.1323940"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1982.1102982"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"e_1_3_2_1_11_1","volume-title":"On the bipartition of graphs. Discrete applied mathematics","author":"Buser Peter","year":"1984","unstructured":"Peter Buser . 1984. On the bipartition of graphs. Discrete applied mathematics , Vol. 9 , 1 ( 1984 ), 105--109. Peter Buser. 1984. On the bipartition of graphs. Discrete applied mathematics , Vol. 9, 1 (1984), 105--109."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2005.1582514"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 4th International Conference on Networked Systems (Lecture Notes in Computer Science","volume":"136","author":"Chakraborty Maitri","unstructured":"Maitri Chakraborty , Alessia Milani , and Miguel A. Mosteiro . 2016. Counting in Practical Anonymous Dynamic Networks is Polynomial . In Proceedings of the 4th International Conference on Networked Systems (Lecture Notes in Computer Science , Vol. 9944). 131-- 136 . Maitri Chakraborty, Alessia Milani, and Miguel A. Mosteiro. 2016. Counting in Practical Anonymous Dynamic Networks is Polynomial. In Proceedings of the 4th International Conference on Networked Systems (Lecture Notes in Computer Science, Vol. 9944). 131--136."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0367-4"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2247462"},{"key":"e_1_3_2_1_16_1","volume-title":"Fast Agreement in Networks with Byzantine Nodes. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference (LIPIcs","volume":"18","author":"Chlebus Bogdan S.","year":"2020","unstructured":"Bogdan S. Chlebus , Dariusz R. Kowalski , and Jan Olkowski . 2020 . Fast Agreement in Networks with Byzantine Nodes. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference (LIPIcs , Vol. 179). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 30:1--30: 18 . Bogdan S. Chlebus, Dariusz R. Kowalski, and Jan Olkowski. 2020. Fast Agreement in Networks with Byzantine Nodes. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference (LIPIcs, Vol. 179). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 30:1--30:18."},{"key":"e_1_3_2_1_17_1","volume-title":"Consensus in Networks Prone to Link Failures. CoRR","author":"Chlebus Bogdan S.","year":"2021","unstructured":"Bogdan S. Chlebus , Dariusz R. Kowalski , Jan Olkowski , and Jedrzej Olkowski . 2021. Consensus in Networks Prone to Link Failures. CoRR , Vol. abs\/ 2102 .01251 ( 2021 ). arxiv: 2102.01251 https:\/\/arxiv.org\/abs\/2102.01251 Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski, and Jedrzej Olkowski. 2021. Consensus in Networks Prone to Link Failures. CoRR , Vol. abs\/2102.01251 (2021). arxiv: 2102.01251 https:\/\/arxiv.org\/abs\/2102.01251"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. of the 19th Intl. Conf. on Principles of Distributed Systems (Leibniz-Zentrum f\u00fc r Informatik).","author":"Di Luna Giuseppe Antonio","year":"2015","unstructured":"Giuseppe Antonio Di Luna and Roberto Baldoni . 2015 . Non Trivial Computations in Anonymous Dynamic Networks . In Proc. of the 19th Intl. Conf. on Principles of Distributed Systems (Leibniz-Zentrum f\u00fc r Informatik). Giuseppe Antonio Di Luna and Roberto Baldoni. 2015. Non Trivial Computations in Anonymous Dynamic Networks. In Proc. of the 19th Intl. Conf. on Principles of Distributed Systems (Leibniz-Zentrum f\u00fc r Informatik)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45249-9_17"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. of the 34th Intl. Conf. on Distributed Computing Systems. IEEE, 338--347","author":"Di Luna Giuseppe Antonio","year":"2014","unstructured":"Giuseppe Antonio Di Luna , Roberto Baldoni , Silvia Bonomi , and Ioannis Chatzigiannakis . 2014 b. Counting in Anonymous Dynamic Networks under Worst-Case Adversary . In Proc. of the 34th Intl. Conf. on Distributed Computing Systems. IEEE, 338--347 . Giuseppe Antonio Di Luna , Roberto Baldoni, Silvia Bonomi, and Ioannis Chatzigiannakis. 2014b. Counting in Anonymous Dynamic Networks under Worst-Case Adversary. In Proc. of the 34th Intl. Conf. on Distributed Computing Systems. IEEE, 338--347."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45346-5_11"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1984-0743744-X"},{"key":"e_1_3_2_1_23_1","volume-title":"Random graph dynamics","author":"Durrett Richard","unstructured":"Richard Durrett . 2007. Random graph dynamics . Vol. 200 . Citeseer . Richard Durrett. 2007. Random graph dynamics . Vol. 200. Citeseer."},{"key":"e_1_3_2_1_24_1","first-page":"290","article-title":"On Random graphs","volume":"6","author":"ErdHos P.","year":"1959","unstructured":"P. ErdHos and A. R\u00e9nyi . 1959 . On Random graphs . I. Publicationes Matematicae , Vol. 6 (1959), 290 -- 297 . P. ErdHos and A. R\u00e9nyi. 1959. On Random graphs. I. Publicationes Matematicae , Vol. 6 (1959), 290--297.","journal-title":"I. Publicationes Matematicae"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of the 10th LATIN (Lecture Notes in Computer Science","volume":"314","author":"Farach-Colton M.","unstructured":"M. Farach-Colton , A. Fern\u00e1ndez Anta , A. Milani , M. A. Mosteiro , and S. Zaks . 2012. Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism . In Proc. of the 10th LATIN (Lecture Notes in Computer Science , Vol. 7256). Springer-Verlag, Berlin, 303-- 314 . M. Farach-Colton, A. Fern\u00e1ndez Anta, A. Milani, M. A. Mosteiro, and S. Zaks. 2012. Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism. In Proc. of the 10th LATIN (Lecture Notes in Computer Science, Vol. 7256). Springer-Verlag, Berlin, 303--314."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026704"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0165-9"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830910000796"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.09.013"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0075"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.3456080"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.812781"},{"key":"e_1_3_2_1_35_1","volume-title":"Proc. of the 44th IEEE Ann. Symp. on Foundations of Computer Science. 482--491","author":"Kempe D.","unstructured":"D. Kempe , A. Dobra , and J. Gehrke . 2003. Gossip-based computation of aggregate information . In Proc. of the 44th IEEE Ann. Symp. on Foundations of Computer Science. 482--491 . D. Kempe, A. Dobra, and J. Gehrke. 2003. Gossip-based computation of aggregate information. In Proc. of the 44th IEEE Ann. Symp. on Foundations of Computer Science. 482--491."},{"key":"e_1_3_2_1_36_1","volume-title":"Mosteiro","author":"Kowalski Dariusz R.","year":"2019","unstructured":"Dariusz R. Kowalski and Miguel A . Mosteiro . 2019 . Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader. In Proc. of the 46th International Colloquium on Automata, Languages, and Programming (LIPIcs , Vol. 132). Leibniz-Zentrum f\u00fc r Informatik, 147:1--147: 15 . Dariusz R. Kowalski and Miguel A. Mosteiro. 2019. Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader. In Proc. of the 46th International Colloquium on Automata, Languages, and Programming (LIPIcs, Vol. 132). Leibniz-Zentrum f\u00fc r Informatik, 147:1--147:15."},{"key":"e_1_3_2_1_37_1","first-page":"17","volume-title":"ACM","volume":"67","author":"Dariusz","year":"2020","unstructured":"Dariusz R. Kowalski and Miguel A. Mosteiro. 2020. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. J . ACM , Vol. 67 , 2, Article 11 ( 2020 ), bibinfonumpages 17 pages. Dariusz R. Kowalski and Miguel A. Mosteiro. 2020. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. J. ACM , Vol. 67, 2, Article 11 (2020), bibinfonumpages17 pages."},{"key":"e_1_3_2_1_38_1","volume-title":"Time and Communication Complexity of Leader Election in Anonymous Networks. In 41st IEEE International Conference on Distributed Computing Systems (ICDCS","author":"Dariusz","year":"2021","unstructured":"Dariusz R. Kowalski and Miguel A. Mosteiro. 2021 . Time and Communication Complexity of Leader Election in Anonymous Networks. In 41st IEEE International Conference on Distributed Computing Systems (ICDCS 2021 ), accepted for publication . Dariusz R. Kowalski and Miguel A. Mosteiro. 2021. Time and Communication Complexity of Leader Election in Anonymous Networks. In 41st IEEE International Conference on Distributed Computing Systems (ICDCS 2021), accepted for publication ."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272825"},{"key":"e_1_3_2_1_40_1","unstructured":"Nancy A Lynch. 1996. Distributed algorithms .Morgan Kauffman.  Nancy A Lynch. 1996. Distributed algorithms .Morgan Kauffman."},{"key":"e_1_3_2_1_41_1","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"Michail Othon","unstructured":"Othon Michail , Ioannis Chatzigiannakis , and Paul G Spirakis . 2013. Naming and counting in anonymous unknown dynamic networks . In Stabilization, Safety, and Security of Distributed Systems . Springer , 281--295. Othon Michail, Ioannis Chatzigiannakis, and Paul G Spirakis. 2013. Naming and counting in anonymous unknown dynamic networks. In Stabilization, Safety, and Security of Distributed Systems. Springer, 281--295."},{"key":"e_1_3_2_1_42_1","volume-title":"Proc. of the 19th Intl. Conf. on Principles of Distributed Systems (Leibniz-Zentrum f\u00fc r Informatik","volume":"13","author":"Milani Alessia","unstructured":"Alessia Milani and Miguel A. Mosteiro . 2015. A Faster Counting Protocol for Anonymous Dynamic Networks . In Proc. of the 19th Intl. Conf. on Principles of Distributed Systems (Leibniz-Zentrum f\u00fc r Informatik , Vol. 46). 1-- 13 . Alessia Milani and Miguel A. Mosteiro. 2015. A Faster Counting Protocol for Anonymous Dynamic Networks. In Proc. of the 19th Intl. Conf. on Principles of Distributed Systems (Leibniz-Zentrum f\u00fc r Informatik, Vol. 46). 1--13."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90029-4"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1273094"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924648"},{"key":"e_1_3_2_1_46_1","volume-title":"Combinatorial Algorithms for Computers and Calculators: 2d Ed","author":"Nijenhuis Albert","unstructured":"Albert Nijenhuis and Herbert S Wilf . 1978. Combinatorial Algorithms for Computers and Calculators: 2d Ed . Academic Press . Albert Nijenhuis and Herbert S Wilf. 1978. Combinatorial Algorithms for Computers and Calculators: 2d Ed .Academic Press."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"e_1_3_2_1_48_1","volume-title":"Random Geometric Graphs","author":"Penrose M.","unstructured":"M. Penrose . 2003. Random Geometric Graphs . Oxford University Press . M. Penrose. 2003. Random Geometric Graphs .Oxford University Press."},{"key":"e_1_3_2_1_49_1","volume-title":"Proc. of the 39th IEEE Ann. Symp. on Foundations of Computer Science . 694--703","author":"Rabani Y.","unstructured":"Y. Rabani , A. Sinclair , and R. Wanka . 1998. Local Divergence of Markov Chains and the Analysis of Iterative Load-balancing Schemes . In Proc. of the 39th IEEE Ann. Symp. on Foundations of Computer Science . 694--703 . Y. Rabani, A. Sinclair, and R. Wanka. 1998. Local Divergence of Markov Chains and the Analysis of Iterative Load-balancing Schemes. In Proc. of the 39th IEEE Ann. Symp. on Foundations of Computer Science . 694--703."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909171"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.02.044"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"e_1_3_2_1_54_1","volume-title":"\u201csmall-world","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz . 1998. Collective dynamics of \u201csmall-world \u201d networks. nature , Vol. 393 , 6684 ( 1998 ), 440--442. Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of \u201csmall-world\u201d networks. nature , Vol. 393, 6684 (1998), 440--442."}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Virtual Event USA","acronym":"SPAA '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461811","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3409964.3461811","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461811","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":52,"alternative-id":["10.1145\/3409964.3461811","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461811","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}