A parallel median algorithm
From MaRDI portal
Publication:1062763
DOI10.1016/0020-0190(85)90080-8zbMath0573.68032OpenAlexW2053422185MaRDI QIDQ1062763
Chee-Keng Yap, Richard John Cole
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90080-8
Related Items (9)
Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers ⋮ An optimally efficient selection algorithm ⋮ Distributed algorithms for selection in sets ⋮ Optimal parallel selection has complexity O(log log N) ⋮ Faster deterministic sorting through better sampling. ⋮ Optimal parallel selection in sorted matrices ⋮ Finding effective ``Force targets for two-dimensional, multifinger frictional grips ⋮ Computing with Spikes: The Advantage of Fine-Grained Timing ⋮ Deterministic sorting in nearly logarithmic time on the hypercube and related computers
Cites Work
This page was built for publication: A parallel median algorithm
