Time-optimal leader election in general networks
Open Access
- 1 January 1990
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 8 (1) , 96-99
- https://doi.org/10.1016/0743-7315(90)90074-y
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Token Distribution ProblemSIAM Journal on Computing, 1989
- Fault Tolerance in Networks of Bounded DegreeSIAM Journal on Computing, 1988
- Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronizationNetworks, 1985
- Complexity of network synchronizationJournal of the ACM, 1985
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983