Bitonic Sort on a Mesh-Connected Parallel Computer. - David Nassimi; Sartaj Sahni (IEEE Trans. Computers, 1979)

A Self-Routing Benes Network. - David Nassimi (ISCA, 1980)

An optimal routing algorithm for mesh-connected Parallel computers. - David Nassimi; Sartaj Sahni (J. ACM, 1980)

Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer. - David Nassimi; Sartaj Sahni (SIAM J. Comput., 1980)

Parallel Matrix and Graph Algorithms. - Eliezer Dekel; David Nassimi; Sartaj Sahni (SIAM J. Comput., 1981)

Data Broadcasting in SIMD Computers. - David Nassimi; Sartaj Sahni (IEEE Trans. Computers, 1981)

A Self-Routing Benes Network and Parallel Permutation Algorithms. - David Nassimi; Sartaj Sahni (IEEE Trans. Computers, 1981)

Parallel permutation and sorting algorithms and a new generalized connection network. - David Nassimi; Sartaj Sahni (J. ACM, 1982)

Parallel Algorithms to Set Up the Benes Permutation Network. - David Nassimi; Sartaj Sahni (IEEE Trans. Computers, 1982)

Optimal BPC Permutations on a Cube Connected SIMD Computer. - David Nassimi; Sartaj Sahni (IEEE Trans. Computers, 1982)

A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks. - David Nassimi (ICPP (1), 1989)

Efficient Implementations of a Class of ± 2b Parallel Computations on a SIMD Hypercube. - David Nassimi; Yuh-Dong Tsai (IPPS, 1991)

Parallel Algorithms for PM2B-ASCEND Computations on a SIMD Hypercube Using Multiple Levels of Iteration-Grouping. - David Nassimi (ICPP (3), 1992)

VLSI Architectures for Recursive and Multiple-Window Order Statistic Filtering. - M. Reza Hakami; Peter J. Warter; Charles G. Boncelet Jr.; David Nassimi (IPPS, 1992)

Nearly Logarithmic Time Parallel Algorithms for the Class of pm2^b ASCEND Computations on a SIMD Hypercube. - David Nassimi (IPPS, 1992)

A Parallel MSF Algorithm for Planar Graphs on a Mesh and Applications to Image Processing. - David Nassimi (IPPS, 1993)

An Efficient Implementation of Batcher's Odd-Even Merge on a SIMD Hypercube. - David Nassimi; Yuh-Dong Tsai (J. Parallel Distributed Comput., 1993)

Efficient VLSI Implementation of Iterative Solutions to Sparse Linear Systems. - Manavendra Misra; David Nassimi; Viktor K. Prasanna (Parallel Comput., 1993)

Parallel Algorithms for the Classes of +or-2b DESCEND and ASCEND Computations on a SIMD Hypercube. - David Nassimi (IEEE Trans. Parallel Distributed Syst., 1993)

The Generalized Class of g-Chaln Periodic Sorting Networks. - David Nassimi; Yehoshua Perl; Ronald I. Becker (IPPS, 1994)

Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2b ASCEND Computations on a SIMD Hypercube. - David Nassimi (J. Parallel Distributed Comput., 1994)

H-PBS: a hash-based scalable technique for parallel bidirectional search. - David Nassimi; Milind Joshi; Andrew Sohn (SPDP, 1995)

The New Class of g-Chain Periodic Sorters. - Ronald I. Becker; David Nassimi; Yehoshua Perl (J. Parallel Distributed Comput., 1998)