Authors
Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon
Publication date
1996/6/10
Conference
ISTCS
Pages
16-26
Description
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 (ie, if election is impossible all processors detect this fact in a distributed way).
Total citations
Scholar articles
P Boldi, S Shammah, S Vigna, B Codenotti, P Gemmell… - ISTCS, 1996