TY - GEN

T1 - A technique for proving lower bounds for distributed maximum-finding algorithms

AU - Pachl, J.

AU - Korach, E.

AU - Rotem, D.

N1 - Publisher Copyright:
© 1982 ACM.

PY - 1982/5/5

Y1 - 1982/5/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84987031726&partnerID=8YFLogxK

U2 - 10.1145/800070.802213

DO - 10.1145/800070.802213

M3 - Conference contribution

AN - SCOPUS:84987031726

SN - 0897910702

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 378

EP - 382

BT - Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982

PB - Association for Computing Machinery

T2 - 14th Annual ACM Symposium on Theory of Computing, STOC 1982

Y2 - 5 May 1982 through 7 May 1982

ER -