default search action

combined dblp search
author search
venue search
publication search

ask others

"Two Rounds Are Enough for Reconstructing Any Graph (Class) in the ..."

Pedro Montealegre et al. (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-030-01325-7_15

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sirocco/MontealegrePRT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sirocco/MontealegrePRT18
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. SIROCCO 2018: 134-148

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.