Massive parallelization of divide-and-conquer algorithms over powerlists
type: Item
instance of: scholarly article
title: Massive parallelization of divide-and-conquer algorithms over powerlists
zbMATH Open document ID: 0853.68107
DOI: 10.1016/0167-6423(95)00022-4
author: Klaus Achatz
author: Wolfram Schulte
published in: Science of Computer Programming
publication date: 1996-07-03T00:00:00Z
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 896511
zbMATH Keywords: divide-and-conquer algorithms
MaRDI profile type: Publication
full work available at URL: 0167-6423(95)00022-4
OpenAlex ID: W2003017309
Recommended article: A data-parallel formulation for divide and conquer algorithms
Recommended article: Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
Recommended article: Q3436614
Recommended article: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
Recommended article: Efficient massively parallel implementation of some combinatorial algorithms
Recommended article: Automated reasoning about parallel algorithms using powerlists
Recommended article: Q4813064
Recommended article: Q4952906
Recommended article: Q4327448
Recommended article: Parallel algorithms and architectures for multisplitting iterative methods
description: scientific article; zbMATH DE number 896511