"Deterministic Leader Election Takes Θ(D+log n) Bit Rounds."

Arnaud Casteigts et al. (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0517-3

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/CasteigtsMRZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/CasteigtsMRZ19
Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari:
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica 81(5): 1901-1920 (2019)

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.