Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
- 1 April 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (2) , 376-394
- https://doi.org/10.1137/0220023
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Electing a leader in a synchronous ringJournal of the ACM, 1987
- Efficiency of Synchronous Versus Asynchronous Distributed SystemsJournal of the ACM, 1983
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- On describing the behavior and implementation of distributed systemsTheoretical Computer Science, 1981