Abstract
This note presents a simple time-optimal distributed algorithm for electing a leader in a general network. For several important classes of networks this algorithm is also message-optimal and thus performs better than previous algorithms for the problem.
| Original language | English |
|---|---|
| Pages (from-to) | 96-99 |
| Number of pages | 4 |
| Journal | Journal of Parallel and Distributed Computing |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1990 |
| Externally published | Yes |
Bibliographical note
Funding Information:* Supported in part by a Weizmann fellowship and by the ONR under Contract N00014-85-C-0731. Current address: Department of Applied Mathematics, The Weizmann Institute, Rehovot 76100, Israel.
Funding
* Supported in part by a Weizmann fellowship and by the ONR under Contract N00014-85-C-0731. Current address: Department of Applied Mathematics, The Weizmann Institute, Rehovot 76100, Israel.
| Funders | Funder number |
|---|---|
| Office of Naval Research | N00014-85-C-0731 |