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 Time Required to Perform Addition

S. Winograd

Journal of the ACM

Conference paper

Spatially Constrained Adversarial Attack Detection and Localization in the Representation Space of Optical Flow Networks

Hannah Kim, Celia Cintas, et al.

IJCAI 2023

Conference paper

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

Khalid Abdulla, Andrew Wirth, et al.

ICIAfS 2014

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

View all publications

Abstract

Related

On the Time Required to Perform Addition

Spatially Constrained Adversarial Attack Detection and Localization in the Representation Space of Optical Flow Networks

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

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