Time-optimal leader election in general networks

David Peleg

Research output: Contribution to journalArticlepeer-review

81 Scopus citations

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 languageEnglish
Pages (from-to)96-99
Number of pages4
JournalJournal of Parallel and Distributed Computing
Volume8
Issue number1
DOIs
StatePublished - Jan 1990
Externally publishedYes

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.

Fingerprint

Dive into the research topics of 'Time-optimal leader election in general networks'. Together they form a unique fingerprint.

Cite this