A distributed selection algorithm and its expected communication complexity
type: Item
instance of: scholarly article
title: A distributed selection algorithm and its expected communication complexity
zbMATH Open document ID: 0780.68006
DOI: 10.1016/0304-3975(92)90368-P
author: Jeffrey B. Sidney
author: N. Santoro
author: Stuart J. Sidney
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 64921
zbMATH Keywords: distributed \(K\)-selection problem
zbMATH Keywords: expected communication complexity
zbMATH Keywords: worst-case complexity
zbMATH Keywords: point-to-point model
zbMATH Keywords: distributed selection
MaRDI profile type: Publication
cites work: Lower Bounds on Information Transfer in Distributed Computations
cites work: Q4065051
cites work: An improved algorithm for finding the median distributively
cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns
cites work: Q4745251
cites work: Distributed Sorting
cites work: Shout echo selection in distributed files
cites work: Q3945584
cites work: Q3787482
cites work: Optimal Distributed Algorithms for Sorting and Ranking
description: scientific article; zbMATH DE number 64921