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.

Demo paper

Deepling: A Visual Interpretability System for Convolutional Neural Networks

Daniel Karl I. Weidele, Hendrik Strobelt, et al.

SysML 2019

Conference paper

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

Hagen Soltau, Lidia Mangu, et al.

ASRU 2011

Conference paper

Constraint-based random stimuli generation for hardware verification

Yehuda Naveli, Michal Rimon, et al.

AAAI/IAAI 2006

Paper

A Procedure for Detecting Intersections of Three-Dimensional Objects

Paul G. Comba