Skip to main content
Research
Focus areas
Blog
Publications
Careers
About
Back
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Back
About
Overview
Labs
People
Back
Semiconductors
Back
Artificial Intelligence
Back
Quantum Computing
Back
Hybrid Cloud
Back
Overview
Back
Labs
Back
People
Research
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Blog
Publications
Careers
About
Overview
Labs
People
Open IBM search field
Close
ACM Transactions on Programming Languages and Systems (TOPLAS)
Paper
01 Jul 1984
Distributed algorithms for finding centers and medians in networks
Download paper
Abstract
No abstract available.
Related
Conference paper
A technique for proving lower bounds for distributed maximum-finding algorithms
Paper
Lower Bounds for Distributed Maximum-Finding Algorithms
Conference paper
A technique for proving lower bounds for distributed maximum-finding algorithms
Paper
Lower Bounds for Distributed Maximum-Finding Algorithms
View all publications
