The Complexity of Parallel Prefix Problems on Small Domains

Chaudhuri, Shiva; Radhakrishnan, Jaikumar

Item

ITEM ACTIONSEXPORT

Add to Basket

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

DetailsSummary

The Complexity of Parallel Prefix Problems on Small Domains

Chaudhuri, S., & Radhakrishnan, J. (1997). The Complexity of Parallel Prefix Problems on Small Domains. Information and Computation, 138(1), 1-22.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-39B2-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-39B3-D

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Chaudhuri, Shiva¹, Author
Radhakrishnan, Jaikumar, 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: 1997

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517783
Other: Local-ID: C1256428004B93B8-836E4D784DD91946C125655A0041EF23-Chaudhuri-Radhakrishnan97

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information and Computation

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 138 (1) Sequence Number: - Start / End Page: 1 - 22 Identifier: -