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

Conference paper

From modern standard Arabic to Levantine ASR: Leveraging GALE for dialects

Hagen Soltau, Lidia Mangu, et al.

ASRU 2011

Paper

Active sampling for multiple output identification

Shai Fine, Yishay Mansour

Machine Learning

Talk

Optimal Control of Dynamical Systems via Linearizable Deep Learning

Dzung Phan, Vinicius Lima

INFORMS 2023

View all publications

Abstract

Related

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

From modern standard Arabic to Levantine ASR: Leveraging GALE for dialects

Active sampling for multiple output identification

Optimal Control of Dynamical Systems via Linearizable Deep Learning