Election Algorithms

Tel, G. (2000). Election Algorithms. Introduction to Distributed Algorithms.

Type

Book chapter

Intellectual base

Review or monograph

Year

2000

Pages cited

227-267

DOI

10.1017/cbo9781139168724.008

ISBN

9780521794831

DOI registrant

Cambridge University Press

Link

https://doi.org/10.1017/CBO9781139168724.008

Cited by

1 citation across 1 artifact.

Domain-specific

• Yo-Yo Leader-Election Algorithm
  • Tel defines election as reaching a configuration with exactly one leader and all other processes lost, under a model that can include reliable asynchronous processes, reliable channels, and unique identities.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:d61e791cb33d · see in the full table