The Parallel Complexity of Integer Prefix Summation

Hagerup, Torben

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1331878_3

DetailsSummary

The Parallel Complexity of Integer Prefix Summation

Hagerup, T. (1995). The Parallel Complexity of Integer Prefix Summation. Information Processing Letters, 56(1), 59-64.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACD5-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ACD6-3

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Hagerup, Torben¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1995

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517681
Other: Local-ID: C1256428004B93B8-092CD3AFB3C2F7E8C125645A004612D9-Hagerup-3-95

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 56 (1) Sequence Number: - Start / End Page: 59 - 64 Identifier: ISSN: 0020-0190