The following pages link to David Nassimi (Q1273855):
Displaying 11 items.
- The new class of \(g\)-chain periodic sorters (Q1273856) (← links)
- Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube (Q1325982) (← links)
- Efficient VLSI implementation of iterative solutions to sparse linear systems (Q1801374) (← links)
- An optimal routing algorithm for mesh-connected Parallel computers (Q3856094) (← links)
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer (Q3893326) (← links)
- A Self-Routing Benes Network and Parallel Permutation Algorithms (Q3914895) (← links)
- Parallel Matrix and Graph Algorithms (Q3922163) (← links)
- Parallel permutation and sorting algorithms and a new generalized connection network (Q3949979) (← links)
- Parallel Algorithms to Set Up the Benes Permutation Network (Q3967483) (← links)
- Bitonic Sort on a Mesh-Connected Parallel Computer (Q4170252) (← links)
- (Q4893452) (← links)
