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

Update Disturbance-Resilient Analog ReRAM Crossbar Arrays for In-Memory Deep Learning Accelerators

Wooseok Choi, Tommaso Stecconi, et al.

Advanced Science

Conference paper

A predictive method for identifying optimum cloud availability zones

Merve Unuvar, Yurdaer Doganata, et al.

CLOUD 2014

Conference paper

Multimodal Large Language Models for Inverse Molecular Design with Retrosynthetic Planning

Gang Liu, Michael Sun, et al.

ICLR 2025

Paper

Building interpretable models for business process prediction using shared and specialised attention mechanisms

Bemali Wickramanayake, Zhipeng He, et al.

Knowledge-Based Systems

View all publications

Abstract

Related

Update Disturbance-Resilient Analog ReRAM Crossbar Arrays for In-Memory Deep Learning Accelerators

A predictive method for identifying optimum cloud availability zones

Multimodal Large Language Models for Inverse Molecular Design with Retrosynthetic Planning

Building interpretable models for business process prediction using shared and specialised attention mechanisms