{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:47Z","timestamp":1750220327126,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Singapore Ministry of Education","award":["MOE2017-T2-2-031"],"award-info":[{"award-number":["MOE2017-T2-2-031"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538571","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"131-141","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks"],"prefix":"10.1145","author":[{"given":"Ruomu","family":"Hou","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Irvan","family":"Jahja","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Yucheng","family":"Sun","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Jiyan","family":"Wu","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Haifeng","family":"Yu","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Sebastian Abshoff Markus Benter Andreas Cord-Landwehr Manuel Malatyali and Friedhelm Meyer auf der Heide. 2013. Token Dissemination in Geometric Dynamic Networks. In ALGOSENSORS.  Sebastian Abshoff Markus Benter Andreas Cord-Landwehr Manuel Malatyali and Friedhelm Meyer auf der Heide. 2013. Token Dissemination in Geometric Dynamic Networks. In ALGOSENSORS.","DOI":"10.1007\/978-3-642-45346-5_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. Ahmadi and F. Kuhn. 2017. Multi-message Broadcast in Dynamic Radio Networks. In ALGOSENSORS.  M. Ahmadi and F. Kuhn. 2017. Multi-message Broadcast in Dynamic Radio Networks. In ALGOSENSORS.","DOI":"10.1007\/978-3-319-53058-1_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"M. Ahmadi F. Kuhn S. Kutten A. R. Molla and G. Pandurangan. 2019. The Communication Cost of Information Spreading in Dynamic Networks. In ICDCS.  M. Ahmadi F. Kuhn S. Kutten A. R. Molla and G. Pandurangan. 2019. The Communication Cost of Information Spreading in Dynamic Networks. In ICDCS.","DOI":"10.1109\/ICDCS.2019.00044"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"J. Augustine C. Avin M. Liaee G. Pandurangan and R. Rajaraman. 2016. Information Spreading in Dynamic Networks Under Oblivious Adversaries. In DISC.  J. Augustine C. Avin M. Liaee G. Pandurangan and R. Rajaraman. 2016. Information Spreading in Dynamic Networks Under Oblivious Adversaries. In DISC.","DOI":"10.1007\/978-3-662-53426-7_29"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"John Augustine Gopal Pandurangan and Peter Robinson. 2013. Fast byzantine agreement in dynamic networks. In PODC.  John Augustine Gopal Pandurangan and Peter Robinson. 2013. Fast byzantine agreement in dynamic networks. In PODC.","DOI":"10.1145\/2484239.2484275"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"J. Augustine G. Pandurangan and P. Robinson. 2015. Fast Byzantine Leader Election in Dynamic Networks. In DISC.  J. Augustine G. Pandurangan and P. Robinson. 2015. Fast Byzantine Leader Election in Dynamic Networks. In DISC.","DOI":"10.1109\/IPDPS.2015.80"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Chen Avin Michal Koucky and Zvi Lotker. 2008. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In ICALP.  Chen Avin Michal Koucky and Zvi Lotker. 2008. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In ICALP.","DOI":"10.1007\/978-3-540-70575-8_11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20752"},{"volume-title":"Distributed Computing in Faultprone Dynamic Networks. In International Workshop on Theoretical Aspects of Dynamic Distributed Systems.","author":"Brandes P.","key":"e_1_3_2_1_9_1","unstructured":"P. Brandes and F. Meyer auf der Heide. 2012 . Distributed Computing in Faultprone Dynamic Networks. In International Workshop on Theoretical Aspects of Dynamic Distributed Systems. P. Brandes and F. Meyer auf der Heide. 2012. Distributed Computing in Faultprone Dynamic Networks. In International Workshop on Theoretical Aspects of Dynamic Distributed Systems."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0367-4"},{"key":"e_1_3_2_1_11_1","volume-title":"Consensus in Networks Prone to Link Failures. arXiv preprint arXiv:2102.01251","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. arXiv preprint arXiv:2102.01251 ( 2021 ). Bogdan S Chlebus, Dariusz R Kowalski, Jan Olkowski, and Jedrzej Olkowski. 2021. Consensus in Networks Prone to Link Failures. arXiv preprint arXiv:2102.01251 (2021)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Atish Das Sarma Anisur Molla and Gopal Pandurangan. 2012. Fast Distributed Computation in Dynamic Networks via Random Walks. In DISC.  Atish Das Sarma Anisur Molla and Gopal Pandurangan. 2012. Fast Distributed Computation in Dynamic Networks via Random Walks. In DISC.","DOI":"10.1007\/978-3-642-33651-5_10"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"A. Das Sarma A. Molla and G. Pandurangan. 2015. Distributed Computation in Dynamic Networks via Random Walks. Theor. Comput. Sci. 581 C (May 2015) 45--66.  A. Das Sarma A. Molla and G. Pandurangan. 2015. Distributed Computation in Dynamic Networks via Random Walks. Theor. Comput. Sci. 581 C (May 2015) 45--66.","DOI":"10.1016\/j.tcs.2015.02.044"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"O. Denysyuk and L. Rodrigues. 2014. Random Walks on Evolving Graphs with Recurring Topologies. In DISC.  O. Denysyuk and L. Rodrigues. 2014. Random Walks on Evolving Graphs with Recurring Topologies. In DISC.","DOI":"10.1007\/978-3-662-45174-8_23"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari Nancy Lynch and Calvin Newport. 2013. The cost of radio network broadcast for different models of unreliable links. In PODC.  Mohsen Ghaffari Nancy Lynch and Calvin Newport. 2013. The cost of radio network broadcast for different models of unreliable links. In PODC.","DOI":"10.1145\/2484239.2484259"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Bernhard Haeupler and David Karger. 2011. Faster information dissemination in dynamic networks via network coding. In PODC.  Bernhard Haeupler and David Karger. 2011. Faster information dissemination in dynamic networks via network coding. In PODC.","DOI":"10.1145\/1993806.1993885"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Irvan Jahja and Haifeng Yu. 2020. Sublinear Algorithms in -interval Dynamic Networks. In SPAA.  Irvan Jahja and Haifeng Yu. 2020. Sublinear Algorithms in -interval Dynamic Networks. In SPAA.","DOI":"10.1145\/3350755.3400228"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"J. Katz and Y. Lindell. 2020. Introduction to modern cryptography. CRC press.  J. Katz and Y. Lindell. 2020. Introduction to modern cryptography. CRC press.","DOI":"10.1201\/9781351133036"},{"key":"e_1_3_2_1_20_1","unstructured":"D. Kowalski and M. Mosteiro. 2018. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. In ICALP.  D. Kowalski and M. Mosteiro. 2018. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. In ICALP."},{"key":"e_1_3_2_1_21_1","unstructured":"Dariusz R Kowalski and Miguel A Mosteiro. 2019. Polynomial anonymous dynamic distributed computing without a unique leader. In ICALP.  Dariusz R Kowalski and Miguel A Mosteiro. 2019. Polynomial anonymous dynamic distributed computing without a unique leader. In ICALP."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Dariusz R Kowalski and Miguel A Mosteiro. 2021. Supervised Average Consensus in Anonymous Dynamic Networks. In SPAA.  Dariusz R Kowalski and Miguel A Mosteiro. 2021. Supervised Average Consensus in Anonymous Dynamic Networks. In SPAA.","DOI":"10.1145\/3409964.3461811"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Fabian Kuhn Nancy Lynch and Rotem Oshman. 2010. Distributed Computation in Dynamic Networks. In STOC.  Fabian Kuhn Nancy Lynch and Rotem Oshman. 2010. Distributed Computation in Dynamic Networks. In STOC.","DOI":"10.1145\/1806689.1806760"},{"volume-title":"International Conference on Distributed Computing and Networking.","author":"Luna G.","key":"e_1_3_2_1_24_1","unstructured":"G. Luna , R. Baldoni , S. Bonomi , and I. Chatzigiannakis . 2014. Conscious and unconscious counting on anonymous dynamic networks . In International Conference on Distributed Computing and Networking. G. Luna, R. Baldoni, S. Bonomi, and I. Chatzigiannakis. 2014. Conscious and unconscious counting on anonymous dynamic networks. In International Conference on Distributed Computing and Networking."},{"volume-title":"Counting in Anonymous Dynamic Networks Under Worst-Case Adversary. In IEEE International Conference on Distributed Computing Systems.","author":"Luna G.","key":"e_1_3_2_1_25_1","unstructured":"G. Luna , R. Baldoni , S. Bonomi , and I. Chatzigiannakis . 2014 . Counting in Anonymous Dynamic Networks Under Worst-Case Adversary. In IEEE International Conference on Distributed Computing Systems. G. Luna, R. Baldoni, S. Bonomi, and I. Chatzigiannakis. 2014. Counting in Anonymous Dynamic Networks Under Worst-Case Adversary. In IEEE International Conference on Distributed Computing Systems."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"G. Luna S. Bonomi I. Chatzigiannakis and R. Baldoni. 2013. Counting in anonymous dynamic networks: An experimental perspective. In ALGOSENSORS.  G. Luna S. Bonomi I. Chatzigiannakis and R. Baldoni. 2013. Counting in anonymous dynamic networks: An experimental perspective. In ALGOSENSORS.","DOI":"10.1007\/978-3-642-45346-5_11"},{"volume-title":"Proceedings of International Symposium on Stabilization, Safety, and Security of Distributed Systems.","author":"Michail O.","key":"e_1_3_2_1_27_1","unstructured":"O. Michail , I. Chatzigiannakis , and P. Spirakis . 2013. Naming and Counting in Anonymous Unknown Dynamic Networks . In Proceedings of International Symposium on Stabilization, Safety, and Security of Distributed Systems. O. Michail, I. Chatzigiannakis, and P. Spirakis. 2013. Naming and Counting in Anonymous Unknown Dynamic Networks. In Proceedings of International Symposium on Stabilization, Safety, and Security of Distributed Systems."},{"key":"e_1_3_2_1_28_1","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"Peleg D.","year":"1987","unstructured":"D. Peleg . 1987 . Distributed Computing: A Locality-Sensitive Approach . Society for Industrial and Applied Mathematics , Philadelphia, Pennsylvania . D. Peleg. 1987. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania."},{"key":"e_1_3_2_1_29_1","first-page":"181","article-title":"A proof of Bertrand's postulate","volume":"11","author":"Ramanujan S.","year":"1919","unstructured":"S. Ramanujan . 1919 . A proof of Bertrand's postulate . Journal of the Indian Mathematical Society 11 , 181 -- 182 (1919), 27. S. Ramanujan. 1919. A proof of Bertrand's postulate. Journal of the Indian Mathematical Society 11, 181--182 (1919), 27.","journal-title":"Journal of the Indian Mathematical Society"},{"key":"e_1_3_2_1_30_1","volume-title":"Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. In ICALP.","author":"Sauerwald T.","year":"2019","unstructured":"T. Sauerwald and L. Zanetti . 2019 . Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. In ICALP. T. Sauerwald and L. Zanetti. 2019. Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. In ICALP."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209665"}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","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"],"location":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538571","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":31,"alternative-id":["10.1145\/3490148.3538571","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538571","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}