The Complexity of Parallel Prefix Problems on Small Domains

Chaudhuri, Shiva; Radhakrishnan, Jaikumar

doi:10.1006/inco.1997.2654

Local TagsRelease HistoryDetailsSummary

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. doi:10.1006/inco.1997.2654.

Item is Released

show all

Basic

hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-39B2-F Version Permalink: https://hdl.handle.net/21.11116/0000-000E-4009-0

Genre: Journal Article

Files

hide Files

:

1-s2.0-S0890540197926547-main.pdf (Publisher version), 347KB

View Save

File Permalink:
https://hdl.handle.net/21.11116/0000-000E-400A-F

Name:
1-s2.0-S0890540197926547-main.pdf

Description:
-

OA-Status:
Not specified

Visibility:
Public

MIME-Type / Checksum:
application/pdf / [MD5]

Technical Metadata:

View

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

hide

Creators:
Chaudhuri, Shiva¹, Author
Radhakrishnan, Jaikumar², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

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
BibTex Citekey: Chaudhuri-Radhakrishnan_Inf.Comp.97
DOI: 10.1006/inco.1997.2654

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

hide

Title: Information and Computation

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: San Diego : Academic Press

Pages: - Volume / Issue: 138 (1) Sequence Number: - Start / End Page: 1 - 22 Identifier: ISSN: 0890-5401
CoNE: https://pure.mpg.de/cone/journals/resource/954928487323