Local Computation of Nearly Additive Spanners-Reference-Cited by-同舟云学术

Local Computation of Nearly Additive Spanners

Published:2009 Issue: Volume: Page:176-190
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Derbel Bilel,Gavoille Cyril,Peleg David,Viennot Laurent

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-04355-0_20

Reference38 articles.

1. Jacquet, P., Viennot, L.: Remote spanners: what to know beyond neighbors. In: 23 rd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE Computer Society Press, Los Alamitos (2009)

2. Adjih, C., Laouiti, A., Muhlethaler, P., Qayyum, A., Viennot, L.: The optimised routing protocol for mobile ad-hoc networks: protocol specification. Technical Report 5145, INRIA (March 2003)

3. Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. In: 6 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 77–85. ACM Press, New York (1987)

4. Peleg, D., Schäffer, A.A.: Graph spanners. Journal of Graph Theory 13(1), 99–116 (1989)

5. Awerbuch, B.: Complexity of network synchronization. Journal of the ACM 32(4), 804–823 (1985)

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

1. Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

2. The sparsest additive spanner via multiple weighted BFS trees;Theoretical Computer Science;2020-11

3. Derandomizing local distributed algorithms under bandwidth restrictions;Distributed Computing;2020-04-18

4. Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16

5. Message Reduction in the LOCAL Model is a Free Lunch;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16