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

J. Pachl; E. Korach; D. Rotem

doi:10.1145/800070.802213

STOC 1982

Conference paper

05 May 1982

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

View publication

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.

Conference paper

Probabilistic simulations

Nicholas Pippenger

STOC 1982

Paper

Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl, E. Korach, et al.

Journal of the ACM

Conference paper

Polynomial algorithms for multiple processor agreement

Danny Dolev, H. Raymond Strong

STOC 1982

Paper

Distributed algorithms for finding centers and medians in networks

E. Korach, D. Rotem, et al.

ACM Transactions on Programming Languages and Systems (TOPLAS)

View all publications

Abstract

Related

Probabilistic simulations

Lower Bounds for Distributed Maximum-Finding Algorithms

Polynomial algorithms for multiple processor agreement

Distributed algorithms for finding centers and medians in networks