Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
This paper investigates the parallel time and processor complexities of several searching problems involving Monge, staircase-Monge, and Monge-composite arrays. We present array-searching algorithms for concurrent-read-exclusive-write (CREW) PRAMs, hypercubes, and several hypercubic networks. All these algorithms run in near-optimal time, and their processor-time products are all within an O(lgn) factor of the worst-case sequential bounds. Several applications of these algorithms are also given. Two applications improve previous results substantially, and the others provide novel parallel algorithms for problems not previously considered. © 1997 Springer-Verlag New York Inc.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
A. Skumanich
SPIE OE/LASE 1992
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Andrew Skumanich
SPIE Optics Quebec 1993