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

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

R. Sebastian, M. Weise, et al.

ECPPM 2022

Workshop paper

Automated Operator Fusion for GPU-Accelerated SQL: Generation and Evolutionary Refinement

Corey Liam Lammie, Yotam Perlitz, et al.

VLDB 2026

Paper

Changing computing paradigms towards power efficiency

Pavel Klavík, A. Cristiano I. Malossi, et al.

Philos. Trans. R. Soc. A

Conference paper

"the Diagram is like Guardrails": Structuring GenAI-assisted Hypotheses Exploration with an Interactive Shared Representation

Zijian Ding, Michelle Brachman, et al.

C&C 2025

View all publications

Abstract

Related

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

Automated Operator Fusion for GPU-Accelerated SQL: Generation and Evolutionary Refinement

Changing computing paradigms towards power efficiency

"the Diagram is like Guardrails": Structuring GenAI-assisted Hypotheses Exploration with an Interactive Shared Representation