A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version)

Authors:
Jan K. Pachl;E. Korach;D. Rotem
Affiliations:
-;-;-
Venue:
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Year:
1982

Citing 2
Cited 7

Decentralized extrema-finding in circular configurations of processors

Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes

Communications of the ACM

On the bit complexity of distributed computations in a ring with a leader

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A trade-off between information and communication in broadcast protocols

Journal of the ACM (JACM)
Self-stabilizing symmetry breaking in constant-space (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Time and message bounds for election in synchronous and asynchronous complete networks

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Election and traversal in unidirectional networks

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Distributed elections in an archimedean ring of processors

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On the complexity of global computation in the presence of link failures: the general case

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the problem of finding the maximum of a distributed set of distinct integers. The problem is to be solved by a completely distributed asynchronous algorithm.