Pages that link to "Item:Q1099947"
From MaRDI portal
The following pages link to Optimal computation of prefix sums on a binary tree of processors (Q1099947):
Displaying 7 items.
- Parallel general prefix computations with geometric, algebraic, and other applications (Q916378) (← links)
- Parallel prefix computation with few processors (Q1205906) (← links)
- A chained-matrices approach for parallel computation of continued fractions and its applications (Q1332396) (← links)
- Parallel algorithms for connectivity problems on interval graphs (Q1350233) (← links)
- A local-sparing design methodology for fault-tolerant multiprocessors (Q1388972) (← links)
- Parallel newton interpolation on mesh-of-unshuffle network (Q4291040) (← links)
- OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES (Q4819965) (← links)
