"On the Robust Communication Complexity of Bipartite Matching."

Sepehr Assadi, Soheil Behnezhad (2021)

> Home

Details and statistics

DOI: 10.4230/LIPICS.APPROX/RANDOM.2021.48

access: open

type: Conference or Workshop Paper

metadata version: 2021-09-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/approx/AssadiB21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/AssadiB21
Sepehr Assadi, Soheil Behnezhad:
On the Robust Communication Complexity of Bipartite Matching. APPROX-RANDOM 2021: 48:1-48:17

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.