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

J. Pachl, E. Korach, D. Rotem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982
PublisherAssociation for Computing Machinery
Pages378-382
Number of pages5
ISBN (Print)0897910702
DOIs
StatePublished - 5 May 1982
Externally publishedYes
Event14th Annual ACM Symposium on Theory of Computing, STOC 1982 - San Francisco, United States
Duration: 5 May 19827 May 1982

Publication series

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

Conference

Conference14th Annual ACM Symposium on Theory of Computing, STOC 1982
Country/TerritoryUnited States
CitySan Francisco
Period5/05/827/05/82

Cite this