David Nassimi

24 papers A* 1B 1Journal 14Unranked 8
YearRankTypeTitle / Venue / Authors
1998 J jnl
The New Class of g-Chain Periodic Sorters.
J. Parallel Distributed Comput.
Ronald I. Becker, David Nassimi, Yehoshua Perl
1995 — conf
H-PBS: a hash-based scalable technique for parallel bidirectional search.
SPDP
David Nassimi, Milind Joshi, Andrew Sohn
1994 J jnl
Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2
J. Parallel Distributed Comput.
David Nassimi
1994 — conf
The Generalized Class of g-Chaln Periodic Sorting Networks.
IPPS
David Nassimi, Yehoshua Perl, Ronald I. Becker
1993 — conf
A Parallel MSF Algorithm for Planar Graphs on a Mesh and Applications to Image Processing.
IPPS
David Nassimi
1993 J jnl
An Efficient Implementation of Batcher's Odd-Even Merge on a SIMD Hypercube.
J. Parallel Distributed Comput.
David Nassimi, Yuh-Dong Tsai
1993 J jnl
Efficient VLSI Implementation of Iterative Solutions to Sparse Linear Systems.
Parallel Comput.
Manavendra Misra, David Nassimi, Viktor K. Prasanna
1993 J jnl
Parallel Algorithms for the Classes of +or-2
IEEE Trans. Parallel Distributed Syst.
David Nassimi
1993 B conf
The New Class of g-Chain Periodic Sorters.
SPAA
Ronald I. Becker, David Nassimi, Yehoshua Perl
1992 — conf
Nearly Logarithmic Time Parallel Algorithms for the Class of \pm2^b ASCEND Computations on a SIMD Hypercube.
IPPS
David Nassimi
1992 — conf
Parallel Algorithms for PM2B-ASCEND Computations on a SIMD Hypercube Using Multiple Levels of Iteration-Grouping.
ICPP (3)
David Nassimi
1992 — conf
VLSI Architectures for Recursive and Multiple-Window Order Statistic Filtering.
IPPS
M. Reza Hakami, Peter J. Warter, Charles G. Boncelet Jr., David Nassimi
1991 — conf
Efficient Implementations of a Class of ± 2
IPPS
David Nassimi, Yuh-Dong Tsai
1989 — conf
A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks.
ICPP (1)
David Nassimi
1982 J jnl
Optimal BPC Permutations on a Cube Connected SIMD Computer.
IEEE Trans. Computers
David Nassimi, Sartaj Sahni
1982 J jnl
Parallel Algorithms to Set Up the Benes Permutation Network.
IEEE Trans. Computers
David Nassimi, Sartaj Sahni
1982 J jnl
Parallel permutation and sorting algorithms and a new generalized connection network.
J. ACM
David Nassimi, Sartaj Sahni
1981 J jnl
A Self-Routing Benes Network and Parallel Permutation Algorithms.
IEEE Trans. Computers
David Nassimi, Sartaj Sahni
1981 J jnl
Data Broadcasting in SIMD Computers.
IEEE Trans. Computers
David Nassimi, Sartaj Sahni
1981 J jnl
Parallel Matrix and Graph Algorithms.
SIAM J. Comput.
Eliezer Dekel, David Nassimi, Sartaj Sahni
1980 A* conf
A Self-Routing Benes Network.
ISCA
David Nassimi
1980 J jnl
An optimal routing algorithm for mesh-connected Parallel computers.
J. ACM
David Nassimi, Sartaj Sahni
1980 J jnl
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer.
SIAM J. Comput.
David Nassimi, Sartaj Sahni
1979 J jnl
Bitonic Sort on a Mesh-Connected Parallel Computer.
IEEE Trans. Computers
David Nassimi, Sartaj Sahni