Pages that link to "Item:Q1350241"
From MaRDI portal
The following pages link to The parallel complexity of integer prefix summation (Q1350241):
Displaying 9 items.
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- \(k\)-block parallel addition versus 1-block parallel addition in non-standard numeration systems (Q2250444) (← links)
- A class of almost-optimal size-independent parallel prefix circuits (Q2443006) (← links)
- (Q2944023) (← links)
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE (Q3212290) (← links)
- (Q3496340) (← links)
- (Q3746884) (← links)
- A sound and complete abstraction for reasoning about parallel prefix sums (Q5408435) (← links)
- An Improved Parallel Prefix Sums Algorithm (Q6135727) (← links)