Name
Abstract | ||
|---|---|---|
The number of required deques for sorting all sequences of n items in a parallel or series network of deques is considered. It is shown that the optimal number of required deques is O(n12) for a parallel network, while it is O(log n) for a series network. These orders, O(n12) and O(log n), also remain valid for the networks of restricted deques. |
Year | DOI | Venue |
|---|---|---|
1979 | 10.1016/0022-0000(79)90007-2 | Journal of Computer and System Sciences |
Field | DocType | Volume |
Discrete mathematics,Binary logarithm,Combinatorics,Sorting,Mathematics | Journal | 19 |
Issue | ISSN | Citations |
3 | 0022-0000 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |