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

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

Conference paper

Deployment and Management of Time Series Forecasts in Ocean Industry

Fearghal O'Donncha, Albert Akhriev, et al.

Big Data 2021

Talk

Graph-based 3D Generative Small-Molecule Modeling Targeting for Multi Proteins with Enhanced Binding Compatibility

Seung Gu Kang, Jeff Weber, et al.

ACS Fall 2023

Demo paper

The ShareLM Collection and Plugin: Contributing Human-Model Chats for the Benefit of the Community

Shachar Don-Yehiya, Leshem Choshen, et al.

ACL 2025

View all publications

Abstract

Related

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

Deployment and Management of Time Series Forecasts in Ocean Industry

Graph-based 3D Generative Small-Molecule Modeling Targeting for Multi Proteins with Enhanced Binding Compatibility

The ShareLM Collection and Plugin: Contributing Human-Model Chats for the Benefit of the Community