Pages that link to "Item:Q852883"
From MaRDI portal
The following pages link to Faster optimal parallel prefix circuits: new algorithmic construction (Q852883):
Displaying 8 items.
- Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit (Q1402306) (← links)
- Finding optimal parallel prefix circuits with fan-out 2 in constant time (Q1606938) (← links)
- A new approach to constructing optimal parallel prefix circuits with small depth (Q1878701) (← links)
- A new class of depth-size optimal parallel prefix circuits (Q1964344) (← links)
- A class of almost-optimal size-independent parallel prefix circuits (Q2443006) (← links)
- Functional and dynamic programming in the design of parallel prefix networks (Q3021416) (← links)
- (Q4252850) (← links)
- Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers (Q5268090) (← links)