Publisher
Springer Nature Switzerland
Reference17 articles.
1. Awerbuch, B., Goldreich, O., Vainish, R., Peleg, D.: A trade-off between information and communication in broadcast protocols. J. ACM (JACM) 37(2), 238–256 (1990)
2. Baswana, S., Sen, S.: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4), 532–563 (2007)
3. Derbel, B., Gavoille, C., Peleg, D., Viennot, L.: On the locality of distributed sparse spanner construction. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, pp. 273–282 (2008)
4. Dufoulon, F., Kutten, S., Moses, W.K., Jr., Pandurangan, G., Peleg, D.: An almost singularly optimal asynchronous distributed MST algorithm. arXiv preprint arXiv:2210.01173 (2022)
5. Elkin, M.: A simple deterministic distributed mst algorithm with near-optimal time and message complexities. J. ACM (JACM) 67(2), 1–15 (2020)