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.

Demo paper

AutoTuneX: Interactive Automated Fine-Tuning for Large Language Models

Daniel Karl I. Weidele, Priyanshu Rai, et al.

AAAI 2026

Conference paper

Program equivalence and context-free grammars

Barry K. Rosen

SWAT 1972

Paper

Few shot chain-of-thought driven reasoning to prompt LLMs for open-ended medical question answering

Saeel Sandeep Nachane, Ojas Gramopadhye, et al.

EMNLP 2024

Paper

Designing irregular parallel algorithms with mutual exclusion and lock-free protocols

Guojing Cong, David A. Bader

Journal of Parallel and Distributed Computing

View all publications

Abstract

Related

AutoTuneX: Interactive Automated Fine-Tuning for Large Language Models

Program equivalence and context-free grammars

Few shot chain-of-thought driven reasoning to prompt LLMs for open-ended medical question answering

Designing irregular parallel algorithms with mutual exclusion and lock-free protocols