Skip to content

Author

Michael Elkin

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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 · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.