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

Optimal parallel selection in sorted matrices

โœ Scribed by Hong Shen; Sarnath Ramnath

Book ID
107766320
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
626 KB
Volume
59
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Parallel Selection and Searching in P
On Parallel Selection and Searching in Partial Orders: Sorted Matrices
โœ R. Sarnath; Xin He ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 246 KB

rithm given by Cole [3] runs in O(log n log\* n) time on an EREW PRAM and in O(log n log\* n/log log n) time on a CRCW PRAM. Both algorithms perform O(n) operations. However, not much work has been done on parallel algorithms for constrained selection. The sequential algorithm in [5] is parallelizab