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

On the relationship between novelty and popularity of user-generated content

David Carmel, Haggai Roitman, et al.

ACM TIST

Workshop paper

Towards a No-code Resilient Intelligent Automation System

Segev Shlomov, Avi Yaeli

CHI 2024

Conference paper

Social navigation through the Spoken Web: Improving audio access through collaborative filtering in Gujarat, India

Robert Farrell, Rajarshi Das, et al.

AAAI-SS 2010

Conference paper

Towards European standardization of digitalization approaches for monitoring and safety of bridges and tunnels

R. Sebastian, M. Weise, et al.

ECPPM 2022

View all publications

Abstract

Related

On the relationship between novelty and popularity of user-generated content

Towards a No-code Resilient Intelligent Automation System

Social navigation through the Spoken Web: Improving audio access through collaborative filtering in Gujarat, India

Towards European standardization of digitalization approaches for monitoring and safety of bridges and tunnels