David Nassimi

According to our database, David Nassimi authored at least 23 papers between 1979 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

The New Class of g-Chain Periodic Sorters.

Ronald I. Becker, David Nassimi, Yehoshua Perl

J. Parallel Distributed Comput., 1998

1995

H-PBS: a hash-based scalable technique for parallel bidirectional search.

David Nassimi, Milind Joshi, Andrew Sohn

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

1994

Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2^b ASCEND Computations on a SIMD Hypercube.

David Nassimi

J. Parallel Distributed Comput., 1994

The Generalized Class of g-Chaln Periodic Sorting Networks.

David Nassimi, Yehoshua Perl, Ronald I. Becker

Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993

Parallel Algorithms for the Classes of +or-2^b DESCEND and ASCEND Computations on a SIMD Hypercube.

David Nassimi

IEEE Trans. Parallel Distributed Syst., 1993

Efficient VLSI Implementation of Iterative Solutions to Sparse Linear Systems.

Manavendra Misra, David Nassimi, Viktor K. Prasanna

Parallel Comput., 1993

An Efficient Implementation of Batcher's Odd-Even Merge on a SIMD Hypercube.

David Nassimi, Yuh-Dong Tsai

J. Parallel Distributed Comput., 1993

A Parallel MSF Algorithm for Planar Graphs on a Mesh and Applications to Image Processing.

David Nassimi

Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992

Nearly Logarithmic Time Parallel Algorithms for the Class of \pm2^b ASCEND Computations on a SIMD Hypercube.

David Nassimi

Proceedings of the 6th International Parallel Processing Symposium, 1992

VLSI Architectures for Recursive and Multiple-Window Order Statistic Filtering.

M. Reza Hakami, Peter J. Warter, Charles G. Boncelet Jr., David Nassimi

Proceedings of the 6th International Parallel Processing Symposium, 1992

Parallel Algorithms for PM2B-ASCEND Computations on a SIMD Hypercube Using Multiple Levels of Iteration-Grouping.

David Nassimi

Proceedings of the 1992 International Conference on Parallel Processing, 1992

1991

Efficient Implementations of a Class of ± 2^<i>b</i> Parallel Computations on a SIMD Hypercube.

David Nassimi, Yuh-Dong Tsai

Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

1989

A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks.

David Nassimi

Proceedings of the International Conference on Parallel Processing, 1989

1982

Optimal BPC Permutations on a Cube Connected SIMD Computer.

David Nassimi, Sartaj Sahni

IEEE Trans. Computers, 1982

Parallel Algorithms to Set Up the Benes Permutation Network.

David Nassimi, Sartaj Sahni

IEEE Trans. Computers, 1982

Parallel permutation and sorting algorithms and a new generalized connection network.

David Nassimi, Sartaj Sahni

J. ACM, 1982

1981

A Self-Routing Benes Network and Parallel Permutation Algorithms.

David Nassimi, Sartaj Sahni

IEEE Trans. Computers, 1981

Data Broadcasting in SIMD Computers.

David Nassimi, Sartaj Sahni

IEEE Trans. Computers, 1981

Parallel Matrix and Graph Algorithms.

Eliezer Dekel, David Nassimi, Sartaj Sahni

SIAM J. Comput., 1981

1980

Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer.

David Nassimi, Sartaj Sahni

SIAM J. Comput., 1980

An optimal routing algorithm for mesh-connected Parallel computers.

David Nassimi, Sartaj Sahni

J. ACM, 1980

A Self-Routing Benes Network.

David Nassimi

Proceedings of the 7th Annual Symposium on Computer Architecture, 1980

1979

Bitonic Sort on a Mesh-Connected Parallel Computer.

David Nassimi, Sartaj Sahni

IEEE Trans. Computers, 1979