๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient parallel k selection algorithm

โœ Scribed by Jang-Ping Sheu; Jyh-Shyan Tang


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
330 KB
Volume
35
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An efficient parallel sorting algorithm
โœ Xiaoqing Liu; Junguk L. Kim ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB
An efficient parallel algorithm for mult
โœ S. Olariu; Z. Wen ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

Olariu, S. and Z. Wen, An efficient parallel algorithm for multiselection, Parallel Computing 17 (1991) 689-693. The problem of multiselection arises frequently in databases. Here, given an unordered set S of n records and a sequence of m integers 1 ~< ql < q2 < .--< qm ~< n we are interested in an