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. © 1985.
Author supplied keywords
Cite
CITATION STYLE
APA
Cole, R., & Yap, C. K. (1985). A parallel median algorithm. Information Processing Letters, 20(3), 137–139. https://doi.org/10.1016/0020-0190(85)90080-8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free