| 1998 |
|---|
| 23 | | Ronald I. Becker,
David Nassimi,
Yehoshua Perl:
The New Class of g-Chain Periodic Sorters.
J. Parallel Distrib. Comput. 54(2): 206-222 (1998) |
| 1994 |
|---|
| 22 | | David Nassimi,
Yehoshua Perl,
Ronald I. Becker:
The Generalized Class of g-Chaln Periodic Sorting Networks.
IPPS 1994: 424-432 |
| 21 | | David Nassimi:
Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2b ASCEND Computations on a SIMD Hypercube.
J. Parallel Distrib. Comput. 20(3): 289-302 (1994) |
| 1993 |
|---|
| 20 | | David Nassimi:
A Parallel MSF Algorithm for Planar Graphs on a Mesh and Applications to Image Processing.
IPPS 1993: 205-211 |
| 19 | EE | Ronald I. Becker,
David Nassimi,
Yehoshua Perl:
The New Class of g-Chain Periodic Sorters.
SPAA 1993: 356-364 |
| 18 | EE | David Nassimi:
Parallel Algorithms for the Classes of +or-2/sup b/ DESCEND and ASCEND Computations on a SIMD Hypercube.
IEEE Trans. Parallel Distrib. Syst. 4(12): 1372-1381 (1993) |
| 17 | | David Nassimi,
Yuh-Dong Tsai:
An Efficient Implementation of Batcher's Odd-Even Merge on a SIMD Hypercube.
J. Parallel Distrib. Comput. 19(1): 58-63 (1993) |
| 16 | | Manavendra Misra,
David Nassimi,
Viktor K. Prasanna:
Efficient VLSI Implementation of Iterative Solutions to Sparse Linear Systems.
Parallel Computing 19(5): 525-544 (1993) |
| 1992 |
|---|
| 15 | | David Nassimi:
Parallel Algorithms for PM2B-ASCEND Computations on a SIMD Hypercube Using Multiple Levels of Iteration-Grouping.
ICPP (3) 1992: 221-228 |
| 14 | | David Nassimi:
Nearly Logarithmic Time Parallel Algorithms for the Class of \pm2^b ASCEND Computations on a SIMD Hypercube.
IPPS 1992: 122-129 |
| 13 | | M. Hakami,
P. Warter,
C. Boncelet,
David Nassimi:
VLSI Architectures for Recursive and Multiple-Window Order Statistic Filtering.
IPPS 1992: 294-297 |
| 1991 |
|---|
| 12 | | David Nassimi,
Yuh-Dong Tsai:
Efficient Implementations of a Class of ± 2b Parallel Computations on a SIMD Hypercube.
IPPS 1991: 2-9 |
| 1989 |
|---|
| 11 | | David Nassimi:
A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks.
ICPP (1) 1989: 278-287 |
| 1982 |
|---|
| 10 | | David Nassimi,
Sartaj Sahni:
Parallel Algorithms to Set Up the Benes Permutation Network.
IEEE Trans. Computers 31(2): 148-154 (1982) |
| 9 | | David Nassimi,
Sartaj Sahni:
Optimal BPC Permutations on a Cube Connected SIMD Computer.
IEEE Trans. Computers 31(4): 338-341 (1982) |
| 8 | EE | David Nassimi,
Sartaj Sahni:
Parallel permutation and sorting algorithms and a new generalized connection network.
J. ACM 29(3): 642-667 (1982) |
| 1981 |
|---|
| 7 | | David Nassimi,
Sartaj Sahni:
Data Broadcasting in SIMD Computers.
IEEE Trans. Computers 30(2): 101-107 (1981) |
| 6 | | David Nassimi,
Sartaj Sahni:
A Self-Routing Benes Network and Parallel Permutation Algorithms.
IEEE Trans. Computers 30(5): 332-340 (1981) |
| 5 | | Eliezer Dekel,
David Nassimi,
Sartaj Sahni:
Parallel Matrix and Graph Algorithms.
SIAM J. Comput. 10(4): 657-675 (1981) |
| 1980 |
|---|
| 4 | | David Nassimi:
A Self-Routing Benes Network.
ISCA 1980: 190-195 |
| 3 | EE | David Nassimi,
Sartaj Sahni:
An optimal routing algorithm for mesh-connected Parallel computers.
J. ACM 27(1): 6-29 (1980) |
| 2 | | David Nassimi,
Sartaj Sahni:
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer.
SIAM J. Comput. 9(4): 744-757 (1980) |
| 1979 |
|---|
| 1 | | David Nassimi,
Sartaj Sahni:
Bitonic Sort on a Mesh-Connected Parallel Computer.
IEEE Trans. Computers 28(1): 2-7 (1979) |
