A parallel median algorithm

  • Cole R
  • Yap C
  • 4


    Mendeley users who have this article in their library.
  • 25


    Citations of this article.


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. © 1985.

Author-supplied keywords

  • Parallel algorithm
  • comparison model
  • median
  • selection

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Richard Cole

  • Chee K. Yap

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free