scientific article; zbMATH DE number 1307000
From MaRDI portal
Publication:4252850
Recommendations
- Finding optimal parallel prefix circuits with fan-out 2 in constant time
- Faster optimal parallel prefix circuits: new algorithmic construction
- A class of almost-optimal size-independent parallel prefix circuits
- A new class of depth-size optimal parallel prefix circuits
- A new approach to constructing optimal parallel prefix circuits with small depth
- On the complexity of parallelizing sequential circuits using the parallel-prefix method
- Optimal circuits for parallel multipliers
- Functional and dynamic programming in the design of parallel prefix networks
- Optimal parallel algorithms for Prefix Matching
- scientific article; zbMATH DE number 2166160
Cited in
(17)- Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit
- Finding optimal parallel prefix circuits with fan-out 2 in constant time
- Efficient parallel prefix algorithms on multiport message-passing systems
- A new class of depth-size optimal parallel prefix circuits
- Probabilistic parallel prefix computation
- A class of almost-optimal size-independent parallel prefix circuits
- Minimal parallel prefix circuits
- Functional and dynamic programming in the design of parallel prefix networks
- Much ado about two (pearl), a pearl on parallel prefix computation
- Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
- Depth-size trade-offs for parallel prefix computation
- Parallel Prefix Computation
- The strict time lower bound and optimal schedules for parallel prefix with resource constraints
- On the complexity of parallelizing sequential circuits using the parallel-prefix method
- Fast parallel algorithm for prefix computation in multi-mesh architecture
- Mathematics of Program Construction
- Limited width parallel prefix circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252850)
