Functional and dynamic programming in the design of parallel prefix networks
From MaRDI portal
Publication:3021416
DOI10.1017/S0956796810000304zbMath1220.68046MaRDI QIDQ3021416
Publication date: 25 July 2011
Published in: Journal of Functional Programming (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18)
Uses Software
Cites Work
- Faster optimal parallel prefix circuits: new algorithmic construction
- Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit
- Finding optimal parallel prefix circuits with fan-out 2 in constant time
- The complexity of computations by networks
- Parallel Prefix Computation
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
This page was built for publication: Functional and dynamic programming in the design of parallel prefix networks