David Nassimi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

1998

The New Class of g-Chain Periodic SortersRonald I. Becker, David Nassimi, Yehoshua Perl. jpdc, 54(2):206-222, 1998.

1995

H-PBS: a hash-based scalable technique for parallel bidirectional searchDavid Nassimi, Milind Joshi, Andrew Sohn. spdp 1995: 414-421 [doi]

1994

Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2:::b::: ASCEND Computations on a SIMD HypercubeDavid Nassimi. jpdc, 20(3):289-302, 1994.

The Generalized Class of g-Chaln Periodic Sorting NetworksDavid Nassimi, Yehoshua Perl, Ronald I. Becker. ipps 1994: 424-432

1993

1992

VLSI Architectures for Recursive and Multiple-Window Order Statistic FilteringM. Reza Hakami, Peter J. Warter, Charles G. Boncelet Jr., David Nassimi. ipps 1992: 294-297

Parallel Algorithms for PM2B-ASCEND Computations on a SIMD Hypercube Using Multiple Levels of Iteration-GroupingDavid Nassimi. icpp 1992: 221-228

Nearly Logarithmic Time Parallel Algorithms for the Class of /pm2^b ASCEND Computations on a SIMD HypercubeDavid Nassimi. ipps 1992: 122-129

1991

Efficient Implementations of a Class of ± 2:::::::b::::::: Parallel Computations on a SIMD HypercubeDavid Nassimi, Yuh-Dong Tsai. ipps 1991: 2-9

1989

A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection NetworksDavid Nassimi. icpp 1989: 278-287

1982

Optimal BPC Permutations on a Cube Connected SIMD ComputerDavid Nassimi, Sartaj Sahni. TC, 31(4):338-341, 1982.

Parallel Algorithms to Set Up the Benes Permutation NetworkDavid Nassimi, Sartaj Sahni. TC, 31(2):148-154, 1982.

Parallel permutation and sorting algorithms and a new generalized connection networkDavid Nassimi, Sartaj Sahni. JACM, 29(3):642-667, 1982. [doi]

1981

Parallel Matrix and Graph AlgorithmsEliezer Dekel, David Nassimi, Sartaj Sahni. SICOMP, 10(4):657-675, 1981.

Data Broadcasting in SIMD ComputersDavid Nassimi, Sartaj Sahni. TC, 30(2):101-107, 1981.

A Self-Routing Benes Network and Parallel Permutation AlgorithmsDavid Nassimi, Sartaj Sahni. TC, 30(5):332-340, 1981.

1980

A Self-Routing Benes NetworkDavid Nassimi. isca 1980: 190-195

Finding Connected Components and Connected Ones on a Mesh-Connected Parallel ComputerDavid Nassimi, Sartaj Sahni. SICOMP, 9(4):744-757, 1980.

An optimal routing algorithm for mesh-connected Parallel computersDavid Nassimi, Sartaj Sahni. JACM, 27(1):6-29, 1980. [doi]

1979

Bitonic Sort on a Mesh-Connected Parallel ComputerDavid Nassimi, Sartaj Sahni. TC, 28(1):2-7, 1979.

Sign in or sign up to see more results.

runs on WebDSL