Author

T. Masuzawa

h-index 25 View on Semantic Scholar

We have 1 of 282 papers

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.

Preprint Aug 2026

Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction

A new distributed algorithm for computing a minimum spanning tree (MST) in the CONGEST-KT model, where messages are limited to $O(\log n)$ bits and each vertex initially knows the identifiers of its neighbors, which breaks the quadratic time--message trade-off barrier.

Taisuke Izumi, Naoki Kitamura, T. Masuzawa · 0 citations