Searching for "Tight Bounds on the Complexity of Parallel Sorting" – sorted by Relevance.

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

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

2 documents found, showing 1 through 2.

Routing and Sorting on Meshes with Row and Column Buses
by Torsten Suel, V. K. Prasanna Kumar — 1994
…, pages 387--396, June 1993. [29] F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE…
Cited by 12 (1 self) – Add To MetaCart

Scalable Parallel Implementations of Perceptual Grouping on Connection Machine CM-5
by Viktor K. Prasanna, Cho-Li Wang — 1994 — Connection Machine CM-5", International Conference on Pattern Recognition
…, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. on Computers, Vol. 34, No. 4, pp. 344…
Cited by 3 (3 self) – Add To MetaCart

Showing 1 through 2.

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