Token Dissemination in Geometric Dynamic Networks-Reference-Cited by-同舟云学术

Token Dissemination in Geometric Dynamic Networks

Published:2013-12-13 Issue: Volume: Page:22-34
ISSN:0302-9743
Container-title:Algorithms for Sensor Systems
language:
Short-container-title:

Author:

Abshoff Sebastian,Benter Markus,Cord-Landwehr Andreas,Malatyali Manuel,Meyer auf der Heide Friedhelm

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-45346-5_3

Reference19 articles.

1. Bienkowski, M., Byrka, J., Korzeniowski, M., Meyer auf der Heide, F.: Optimal algorithms for page migration in dynamic networks. J. Discrete Algorithms 7(4), 545–569 (2009)

2. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Analysis and optimization of randomized gossip algorithms. In: 43rd IEEE Conference on Decision and Control, 2004. CDC, vol. 5, pp. 5310–5315 (2004)

3. Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: INFOCOM, pp. 1653–1664 (2005)

4. Brandes, P., Meyer auf der Heide, F.: Distributed computing in fault-prone dynamic networks. In: TADDS, pp. 9–14 (2012)

5. Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: SODA, pp. 717–736 (2013)

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

1. Sublinear Algorithms in T-Interval Dynamic Networks;Algorithmica;2024-07-12

2. Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

3. Sublinear Algorithms in T-interval Dynamic Networks;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06

4. Upper and lower bounds for deterministic broadcast in powerline communication networks;Distributed Computing;2016-02-15

5. Continuous Aggregation in Dynamic Ad-Hoc Networks;Structural Information and Communication Complexity;2014