Author:
Derbel Bilel,Mosbah Mohamed,Zemmari Akka
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference44 articles.
1. Afek, Y., Ricklin, M.: Sparser: a paradigm for running distributed algorithms. J. Algorithms 14, 316–328 (1993)
2. Althofer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9, 81–100 (1993)
3. Awerbuch, B.: Complexity of network synchronization. J. ACM 32, 804–823 (1985)
4. Awerbuch, B., Goldberg, A.V., Luby, M., Poltkin, S.A.: Network decomposition and locality in distributed computation. In: 30th IEEE Symposium on Foundation of Computer Science (FOCS89), pp. 364–369 (1989)
5. Awerbuch, B., Peleg, D.: Sparse partitions. In 31th Symposium on Foundations of Computer Science (FOCS90), pp. 503–513. IEEE Comput. Soc., Los Alamitos (1990)
Cited by
9 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. Distributed Spanner Approximation;SIAM Journal on Computing;2021-01
3. Derandomizing local distributed algorithms under bandwidth restrictions;Distributed Computing;2020-04-18
4. Simple Distributed Spanners in Dense Congest Networks;SOFSEM 2020: Theory and Practice of Computer Science;2020
5. Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16