Skip to main content
Conference ProceedingsOPEN ACCESS

On dividing and conquering independently

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1300 LNCS 634-637
DOI: 10.1007/bfb0002794
6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We suggest that the components of the well known divide-and-conquer paradigm can be profitably presented as independent constructs in a skeletal parallel programming model. We investigate this proposal through the expression of Batcher's bitonic sorting algorithm.

Cite

CITATION STYLE

APA

Cole, M. (1997). On dividing and conquering independently. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 634–637). Springer Verlag. https://doi.org/10.1007/bfb0002794

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