Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference38 articles.
1. Becker, R., Karrenbauer, A., Krinninger, S., Lenzen, C.: Near-optimal approximate shortest paths and transshipment in distributed and streaming models. In: 31st International Symposium on Distributed Computing (DISC), pp. 7:1–7:16 (2017)
2. Bernstein, A., Nanongkai, D.: Distributed exact weighted all-pairs shortest paths in near-linear time. In Proceedings of the 51th Annual ACM SIGACT Symposium on Theory of Computing (STOC) (2019)
3. Bock, F.: An algorithm to construct a minimum directed spanning tree in a directed network. In: Developments in Operations Research, pp. 29–44 (1971)
4. Censor-Hillel, K., Kaski, P., Korhonen, J.H., Lenzen, C., Paz, A., Suomela, J.: Algebraic methods in the congested clique. In: Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pp. 143–152 (2015)
5. Chechik, S., Mukhtar, D.: Single-source shortest paths in the CONGEST model with improved bound. In: Symposium on Principles of Distributed Computing (PODC), pp. 464–473. ACM (2020)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Malware Detection By Distributed Systems with Partial Centralization;2023 IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS);2023-09-07
2. Mind the O˜: Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms;Algorithms;2023-07-11