Michael Elkin, Tanya Goldenfeld. Time-, Message- and Memory-Efficient Distributed Minimum Spanning Tree and Partwise Aggregation. In Julian Shun, Rezaul Alam Chowdhury, editors, Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2026, Royal Holloway, University of London, London, United Kingdom, July 6-10, 2026. pages 341-354, ACM, 2026. [doi]
Abstract is missing.