1 paper
Shashwat Chandra, Yi-Jun Chang, Michal Dory +2
We revisit the classic broadcast problem, wherein we have k messages, each composed of O(logn) bits, distributed arbitrarily across a network. The objective is to broadcast…