Name
Abstract | ||
|---|---|---|
We characterize exactly the cases in which it is possible to elect a leader in an anonymous network of processors by a deterministic algorithm, and we show that for every network there is a weak election algorithm (i.e., if election is impossible all processors detect this fact in a distributed way). |
Year | Venue | Keywords |
|---|---|---|
1996 | ISTCS | symmetry breaking |
Field | DocType | Citations |
Discrete mathematics,Graph,Asynchronous communication,Symmetry breaking,Vertex (geometry),Computer science,Directed graph | Conference | 59 |
PageRank | References | Authors |
2.38 | 12 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paolo Boldi | 1 | 2753 | 156.27 |
| Shella Shammah | 2 | 59 | 2.38 |
| Sebastiano Vigna | 3 | 2731 | 153.47 |
| Bruno Codenotti | 4 | 619 | 49.92 |
| Peter Gemmell | 5 | 675 | 108.87 |
| Janos Simon | 6 | 368 | 50.45 |