Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl; E. Korach; D. Rotem

doi:10.1145/1634.1889

Journal of the ACM

Paper

20 Sep 1984

Lower Bounds for Distributed Maximum-Finding Algorithms

Download paper

Abstract

Tills paper establishes several lower bounds of the form Ω(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller. © 1984, ACM. All rights reserved.

Paper

An effective approximation algorithm for the Malleable Parallel Task Scheduling problem

Liya Fan, Fa Zhang, et al.

JPDC

Workshop paper

Extracting Verb Sense Hierarchies from FrameNet

Ran Iwamoto, Kyoko Ohara

ICLC 2023

Paper

Random projections for support vector machines

Saurabh Paul, Christos Boutsidis, et al.

JMLR

Conference paper

Are GNNs the Right Tool to Mine the Blockchain? The Case of the Bitcoin Generator Scam

Zhikun Yuen, Paula Branco, et al.

DSAA 2023

View all publications

Abstract

Related

An effective approximation algorithm for the Malleable Parallel Task Scheduling problem

Extracting Verb Sense Hierarchies from FrameNet

Random projections for support vector machines

Are GNNs the Right Tool to Mine the Blockchain? The Case of the Bitcoin Generator Scam