Functional and dynamic programming in the design of parallel prefix networks (Q3021416): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computations by networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster optimal parallel prefix circuits: new algorithmic construction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding optimal parallel prefix circuits with fan-out 2 in constant time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel Prefix Computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations / rank | |||
Normal rank |
Latest revision as of 08:39, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Functional and dynamic programming in the design of parallel prefix networks |
scientific article |
Statements
Functional and dynamic programming in the design of parallel prefix networks (English)
0 references
25 July 2011
0 references
parallel prefix network design
0 references