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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Original language	English
Title of host publication	Unknown Host Publication Title
Publisher	ACM
Pages	238-241
Number of pages	4
ISBN (Print)	0897910818
State	Published - 1982

Cite this

TY - GEN

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

AU - Shamir, Eli

AU - Upfal, Eli

PY - 1982

Y1 - 1982

UR - https://www.scopus.com/pages/publications/0020226734

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0020226734

SN - 0897910818

SP - 238

EP - 241

BT - Unknown Host Publication Title

PB - ACM

ER -