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.