Improved universal \(k\)-selection in hypercubes

DOI10.1016/0167-8191(92)90076-JzbMath0741.68060MaRDI QIDQ1186174

Hong Shen

Publication date: 28 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

hypercubesparallel algorithmworst-case time complexityuniversal \(k\)-selection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers ⋮ Optimal parallel selection in sorted matrices

This page was built for publication: Improved universal \(k\)-selection in hypercubes