A Parallel Median Algorithm

Open Webpage

Richard Cole, Chee-Keng Yap

Published: 1985, Last Modified: 12 May 2025Inf. Process. Lett. 1985EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We give a deterministic algorithm for finding the kth smallest item in a set of n items, running in O((log log n)2) parallel time on O(n) processors in Valiant's comparison model.