The parallel complexity of integer prefix summation
type: Item
instance of: scholarly article
title: The parallel complexity of integer prefix summation
zbMATH Open document ID: 0875.68504
DOI: 10.1016/0020-0190(95)00119-W
author: Torben Hagerup
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 983949
zbMATH Keywords: Parallel algorithms
zbMATH Keywords: Prefix summation
zbMATH Keywords: CRCW PRAMs
zbMATH Keywords: Concurrent writing
MaRDI profile type: Publication
cites work: Limits on the power of concurrent-write parallel machines
cites work: Optimal bounds for decision problems on the CRCW PRAM
cites work: Faster optimal parallel prefix sums and list ranking
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: New lower bounds for parallel computation
cites work: Parallel computation with threshold functions
cites work: The Parallel Simplicity of Compaction and Chaining
cites work: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
cites work: Q3817623
Wikidata QID: Q126408249
description: scientific article; zbMATH DE number 983949