Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference26 articles.
1. Complexity of network synchronization;Awerbuch;J. ACM,1985
2. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in: Proc. 19th ACM Symp. on Theory of Computing, May 1987, pp. 230–240
3. B. Awerbuch, Distributed shortest paths algorithms, in: Proc. 21st ACM Symp. on Theory of Computing, May 1989, pp. 230–240
4. B. Awerbuch, B. Berger, L. Cowen, D. Peleg, Near-linear cost sequential and distributed constructions of sparse neighborhood covers, in: Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993, pp. 638–647
5. Fast distributed network decompositions and covers;Awerbuch;J. Parallel Distr. Comp.,1996
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hardware-Based Satellite Network Broadcast Storm Suppression Method;Mobile Networks and Applications;2024-06-08
2. Finding a Small Vertex Cut on Distributed Networks;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Leader Election;Distributed Systems;2023-02-10
4. Decentralized Eigendecomposition for Online Learning Over Graphs With Applications;IEEE Transactions on Signal and Information Processing over Networks;2023
5. Latency, capacity, and distributed minimum spanning trees;Journal of Computer and System Sciences;2022-06