Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem.

Michael Elkin

Browse the full STOC paper archive.