Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 517783.0, MPI für Informatik / Algorithms and Complexity Group
The Complexity of Parallel Prefix Problems on Small Domains
Authors:Chaudhuri, Shiva; Radhakrishnan, Jaikumar
Language:English
Date of Publication (YYYY-MM-DD):1997
Title of Journal:Information and Computation
Volume:138
Issue / Number:1
Start Page:1
End Page:22
Review Status:Peer-review
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Article
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-836E4D784DD91946C125655A0041EF23-...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.