N-PROCESSORS GRAPHS DISTRIBUTIVELY ACHIEVE PERFECT MATCHINGS IN O(log**2N) BEATS.

Eli Shamir*, Eli Upfal

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations
Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherACM
Pages238-241
Number of pages4
ISBN (Print)0897910818
StatePublished - 1982

Cite this