A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.34, Iss.1, 1996-04, pp. : 111-116

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Multi-objective optimal cross-training configuration models for an assembly cell using non-dominated sorting genetic algorithm-II

By Li Qian

International Journal of Computer Integrated Manufacturing, Vol. 25, Iss. 11, 2012-11 ,pp. : 981-995

Taylor & Francis Ltd

Access to resources Recommend Favorite

On a scheme for parallel sorting on heterogeneous clusters

By Cerin C. Gaudiot J.-L.

Future Generation Computer Systems, Vol. 18, Iss. 3, 2002-01 ,pp. : 353-372

Elsevier

Access to resources Recommend Favorite

A Randomized Parallel Sorting Algorithm with an Experimental Study

By Helman D.R. Bader D.A. JáJá J.

Journal of Parallel and Distributed Computing, Vol. 52, Iss. 1, 1998-07 ,pp. : 1-23

Academic Press

Access to resources Recommend Favorite

Partial Evaluation of the Euclidian Algorithm

By Danvy O. Goldberg M.

LISP and Symbolic Computation, Vol. 10, Iss. 2, 1997-07 ,pp. : 101-111

Springer Publishing Company

Access to resources Recommend Favorite

Optimal heapsort algorithm

By Xunrang G. Yuzhang Z.

Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. : 239-243

Elsevier

Access to resources Recommend Favorite