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

Sublinear optimization for machine learning

Kenneth L. Clarkson, Elad Hazan, et al.

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

Multimodal Large Language Models for Inverse Molecular Design with Retrosynthetic Planning

Gang Liu, Michael Sun, et al.

ICLR 2025

Conference paper

A distributed architecture for fast SGD sequence discriminative training of DNN acoustic models

George Saon

SLT 2014

View all publications

Abstract

Related

Sublinear optimization for machine learning

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

Multimodal Large Language Models for Inverse Molecular Design with Retrosynthetic Planning

A distributed architecture for fast SGD sequence discriminative training of DNN acoustic models