On dividing and conquering independently

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1300 LNCS, Issue , 1997, Pages 634-637

  Cole, Murray ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BITONIC SORTING; DIVIDE AND CONQUER; SKELETAL PARALLEL PROGRAMMING;

PARALLEL PROGRAMMING;

EID: 0002411855     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002794     Document Type: Conference Paper

References (4)

1. Axford, T. "The divide-and-conquer paradigm as a basis for parallel language design", in Advances in Parallel Algorithms, Kronsjo L. and Shumsheruddin D. (Eds), Blackwell Scientific, 1992.
2. Kumar, V. and Grama, A. and Gupta, A. and Karypis G. "Introduction to Parallel Computing: Design and Analysis of Algorithms", Benjamin/Cummings, 1994.
3. Misra, J. "Powerlist: A Structure for Parallel Recursion"', in A Classical Mind: Essays in Honour of C. A. R. Hoare, Prentice Hall, 1994.
4. Mou Z.G. and Hudak, P. "An Algebraic Model for Divide and Conquer and its Parallelism", Journal of Supercomputing, volume 2, pages 257-278, 1988.