Book
Open access
Jul 2026
Time-, Message- and Memory-Efficient Distributed Minimum Spanning Tree and Partwise Aggregation
This paper develops a deterministic time-, message- and memory-efficient algorithm for the MST problem and believes that the techniques will be useful for devising memory-efficient algorithms to many other distributed problems.
Michael Elkin, Tanya Goldenfeld
· ACM Symposium on Parallelism... · 0 citations