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 |
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 proceeding › Conference contribution › peer-review
4
Scopus
citations