View in EDS

Tight comparison bounds on the complexity of parallel sorting.

Saved in:
Bibliographic Details
Title: Tight comparison bounds on the complexity of parallel sorting.
Authors: Azar, Yossi, Vishkin, Uzi
Source: SIAM Journal on Computing; June 1987, Vol. 16, p458-464, 7p
Database: Applied Science & Technology Source
Be the first to leave a comment!
You must be logged in first