"Brief announcement: exactly electing a unique leader is not harder than ..."

Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani (2009)

> Home

Details and statistics

DOI: 10.1145/1582716.1582796

access: closed

type: Conference or Workshop Paper

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/podc/KobayashiMT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/KobayashiMT09
Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani:
Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. PODC 2009: 334-335

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.