Distributed Algorithms For Unidirectional Networks
- 1 December 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (6) , 1152-1178
- https://doi.org/10.1137/s009753979223277x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete NetworksSIAM Journal on Computing, 1991
- Efficiency of Synchronous Versus Asynchronous Distributed SystemsJournal of the ACM, 1983
- A Distributed Algorithm for Minimum Weight Directed Spanning TreesIEEE Transactions on Communications, 1983
- Distributed network protocolsIEEE Transactions on Information Theory, 1983
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema ProblemACM Transactions on Programming Languages and Systems, 1982
- The firing squad synchronization problem for a class of polyautomata networksJournal of Computer and System Sciences, 1978
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Economic Traversal of LabyrinthsMathematics Magazine, 1970