On the message complexity of distributed problems
- 1 June 1984
- journal article
- research article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 13 (3), 131-147
- https://doi.org/10.1007/bf00979869
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Distributed algorithms for finding centers and medians in networksACM Transactions on Programming Languages and Systems, 1984
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed ComputationIEEE Transactions on Software Engineering, 1983
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- A Distributed Graph Algorithm: Knot DetectionACM Transactions on Programming Languages and Systems, 1982
- A Distributed Algorithm for Shortest PathsIEEE Transactions on Computers, 1982
- Echo Algorithms: Depth Parallel Operations on General GraphsIEEE Transactions on Software Engineering, 1982
- On an improved algorithm for decentralized extrema finding in circular configurations of processorsCommunications of the ACM, 1982
- Concurrency Control in Distributed Database SystemsACM Computing Surveys, 1981
- Decentralized extrema-finding in circular configurations of processorsCommunications of the ACM, 1980
- An improved algorithm for decentralized extrema-finding in circular configurations of processesCommunications of the ACM, 1979