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.

Conference paper

Selecting an optimal combination of storage & transmission assets with a non-dispatchable electricity supply

Khalid Abdulla, Andrew Wirth, et al.

ICIAfS 2014

Conference paper

Using Causal Inference to Investigate Contraceptive Discontinuation in Sub-Saharan Africa

Victor Akinwande, Megan Macgregor, et al.

IJCAI 2024

Conference paper

Representing and Reasoning with Defaults for Learning Agents

Benjamin N. Grosof

AAAI-SS 1993

Conference paper

Repmet: Representative-based metric learning for classification and few-shot object detection

Leonid Karlinsky, Joseph Shtok, et al.

CVPR 2019

View all publications

Abstract

Related

Selecting an optimal combination of storage & transmission assets with a non-dispatchable electricity supply

Using Causal Inference to Investigate Contraceptive Discontinuation in Sub-Saharan Africa

Representing and Reasoning with Defaults for Learning Agents

Repmet: Representative-based metric learning for classification and few-shot object detection