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

J. Pachl; E. Korach; D. Rotem

doi:10.1145/800070.802213

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

J. Pachl, E. Korach, D. Rotem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

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.

Original language	English
Title of host publication	Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982
Publisher	Association for Computing Machinery
Pages	378-382
Number of pages	5
ISBN (Print)	0897910702
DOIs	https://doi.org/10.1145/800070.802213
State	Published - 5 May 1982
Externally published	Yes
Event	14th Annual ACM Symposium on Theory of Computing, STOC 1982 - San Francisco, United States Duration: 5 May 1982 → 7 May 1982

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0737-8017

Conference

Conference	14th Annual ACM Symposium on Theory of Computing, STOC 1982
Country/Territory	United States
City	San Francisco
Period	5/05/82 → 7/05/82

ASJC Scopus subject areas

Software

Access to Document

10.1145/800070.802213

Cite this

@inproceedings{155412d7d5af4b34969172c3c0f1b46a,

title = "A technique for proving lower bounds for distributed maximum-finding algorithms",

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.",

author = "J. Pachl and E. Korach and D. Rotem",

note = "Publisher Copyright: {\textcopyright} 1982 ACM.; 14th Annual ACM Symposium on Theory of Computing, STOC 1982 ; Conference date: 05-05-1982 Through 07-05-1982",

year = "1982",

month = may,

day = "5",

doi = "10.1145/800070.802213",

language = "English",

isbn = "0897910702",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "378--382",

booktitle = "Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982",

}

Pachl, J, Korach, E & Rotem, D 1982, A technique for proving lower bounds for distributed maximum-finding algorithms. in Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 378-382, 14th Annual ACM Symposium on Theory of Computing, STOC 1982, San Francisco, United States, 5/05/82. https://doi.org/10.1145/800070.802213

A technique for proving lower bounds for distributed maximum-finding algorithms. / Pachl, J.; Korach, E.; Rotem, D.

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Association for Computing Machinery, 1982. p. 378-382 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Pachl, J.

AU - Korach, E.

AU - Rotem, D.

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 -

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this