Searching for "Finding the Maximum, Merging, and Sorting in a Parallel Computation Model." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima Over Small Domains
by Omer Berkman, Yossi Matias, and Prabhakar L. Ragde, V. Ramach — 1998
…. Vishkin. Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB