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

Basis scaling and double pruning for efficient inference in network-based transfer learning

Ken C.L. Wong, Satyananda Kashyap, et al.

Pattern Recognition Letters

Conference paper

Applying alternating structure optimization to word sense disambiguation

Rie Kubota Ando

CoNLL 2006

Paper

High Order Search Methods for Finding Roots

C.A. Micchelli, W.L. Miranker

Journal of the ACM

Conference paper

Program equivalence and context-free grammars

Barry K. Rosen

SWAT 1972

View all publications

Abstract

Related

Basis scaling and double pruning for efficient inference in network-based transfer learning

Applying alternating structure optimization to word sense disambiguation

High Order Search Methods for Finding Roots

Program equivalence and context-free grammars