Searching for "An O(n log n) Sorting Network" – 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.

Logarithmic Time Cost Optimal Parallel Sorting is Not Yet Fast in Practice!
by Lasse Natvig — 1990 — in Practice!", Proc Supercomputing 90, IEEE
…). The AKS O(n log n) sorting network The first parallel sorting algorithm using only O(log n) time…
Cited by 11 (3 self) – Add To MetaCart

Showing 1 through 1.

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