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

Constraint-based random stimuli generation for hardware verification

Yehuda Naveli, Michal Rimon, et al.

AAAI/IAAI 2006

Paper

On the Optimality of the Probability Ranking Scheme in Storage Applications

P.C. Yue, C.K. Wong

Journal of the ACM

Paper

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

Bemali Wickramanayake, Zhipeng He, et al.

Knowledge-Based Systems

Paper

On preservation under homomorphisms and unions of conjunctive queries

Albert Atserias, Anuj Dawar, et al.

Journal of the ACM

View all publications

Abstract

Related

Constraint-based random stimuli generation for hardware verification

On the Optimality of the Probability Ranking Scheme in Storage Applications

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

On preservation under homomorphisms and unions of conjunctive queries