"N-Processors Graph Distributively Achieve Perfect Matchings in ..."

Eli Shamir, Eli Upfal (1982)

> Home

Details and statistics

DOI: 10.1145/800220.806702

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/podc/ShamirU82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/ShamirU82
Eli Shamir, Eli Upfal:
N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) Beats. PODC 1982: 238-241

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.