Sorting using networks of deques

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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(n1 2) for a parallel network, while it is O(log n) for a series network. These orders, O(n1 2) and O(log n), also remain valid for the networks of restricted deques. © 1979.

Cite

CITATION STYLE

APA

Nozaki, A. (1979). Sorting using networks of deques. Journal of Computer and System Sciences, 19(3), 309–315. https://doi.org/10.1016/0022-0000(79)90007-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free