Computing in Anonymous Dynamic Networks Is Linear-Reference-Cited by-同舟云学术

Computing in Anonymous Dynamic Networks Is Linear

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Luna Giuseppe A. Di¹,Viglietta Giovanni²

Affiliation:

1. Sapienza University of Rome,DIAG,Rome,Italy

2. School of Information Science, JAIST,Nomi,Japan

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9996589/9996592/09996879.pdf?arnumber=9996879

Reference42 articles.

1. Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks

2. Counting in Anonymous Dynamic Networks: An Experimental Perspective;di luna;Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems Wireless Networks and Distributed Robotics (ALGOSENSORS ’13),2013

3. Local Terminations and Distributed Computability in Anonymous Networks

4. Counting in Anonymous Dynamic Networks Under Worst-Case Adversary;di luna;Proceedings of the 34th IEEE International Conference on Distributed Computing Systems (ICDCS ’14),2014

5. Randomness vs. Time in Anonymous Networks

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Know Your Audience;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. History Trees and Their Applications;Lecture Notes in Computer Science;2024

3. Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16