N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats

Eli Shamir, Eli Upfal. N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats. In PODC. pages 238-241, 1982.

Abstract

Abstract is missing.