default search action
David Nassimi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
- [j14]Ronald I. Becker, David Nassimi, Yehoshua Perl:
The New Class of g-Chain Periodic Sorters. J. Parallel Distributed Comput. 54(2): 206-222 (1998) - 1995
- [c10]David Nassimi, Milind Joshi, Andrew Sohn:
H-PBS: a hash-based scalable technique for parallel bidirectional search. SPDP 1995: 414-421 - 1994
- [j13]David Nassimi:
Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2b ASCEND Computations on a SIMD Hypercube. J. Parallel Distributed Comput. 20(3): 289-302 (1994) - [c9]David Nassimi, Yehoshua Perl, Ronald I. Becker:
The Generalized Class of g-Chaln Periodic Sorting Networks. IPPS 1994: 424-432 - 1993
- [j12]David Nassimi, Yuh-Dong Tsai:
An Efficient Implementation of Batcher's Odd-Even Merge on a SIMD Hypercube. J. Parallel Distributed Comput. 19(1): 58-63 (1993) - [j11]Manavendra Misra, David Nassimi, Viktor K. Prasanna:
Efficient VLSI Implementation of Iterative Solutions to Sparse Linear Systems. Parallel Comput. 19(5): 525-544 (1993) - [j10]David Nassimi:
Parallel Algorithms for the Classes of +or-2b DESCEND and ASCEND Computations on a SIMD Hypercube. IEEE Trans. Parallel Distributed Syst. 4(12): 1372-1381 (1993) - [c8]David Nassimi:
A Parallel MSF Algorithm for Planar Graphs on a Mesh and Applications to Image Processing. IPPS 1993: 205-211 - [c7]Ronald I. Becker, David Nassimi, Yehoshua Perl:
The New Class of g-Chain Periodic Sorters. SPAA 1993: 356-364 - 1992
- [c6]David Nassimi:
Parallel Algorithms for PM2B-ASCEND Computations on a SIMD Hypercube Using Multiple Levels of Iteration-Grouping. ICPP (3) 1992: 221-228 - [c5]David Nassimi:
Nearly Logarithmic Time Parallel Algorithms for the Class of \pm2^b ASCEND Computations on a SIMD Hypercube. IPPS 1992: 122-129 - [c4]M. Reza Hakami, Peter J. Warter, Charles G. Boncelet Jr., David Nassimi:
VLSI Architectures for Recursive and Multiple-Window Order Statistic Filtering. IPPS 1992: 294-297 - 1991
- [c3]David Nassimi, Yuh-Dong Tsai:
Efficient Implementations of a Class of ± 2b Parallel Computations on a SIMD Hypercube. IPPS 1991: 2-9
1980 – 1989
- 1989
- [c2]David Nassimi:
A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks. ICPP (1) 1989: 278-287 - 1982
- [j9]David Nassimi, Sartaj Sahni:
Parallel permutation and sorting algorithms and a new generalized connection network. J. ACM 29(3): 642-667 (1982) - [j8]David Nassimi, Sartaj Sahni:
Parallel Algorithms to Set Up the Benes Permutation Network. IEEE Trans. Computers 31(2): 148-154 (1982) - [j7]David Nassimi, Sartaj Sahni:
Optimal BPC Permutations on a Cube Connected SIMD Computer. IEEE Trans. Computers 31(4): 338-341 (1982) - 1981
- [j6]Eliezer Dekel
, David Nassimi, Sartaj Sahni:
Parallel Matrix and Graph Algorithms. SIAM J. Comput. 10(4): 657-675 (1981) - [j5]David Nassimi, Sartaj Sahni:
Data Broadcasting in SIMD Computers. IEEE Trans. Computers 30(2): 101-107 (1981) - [j4]David Nassimi, Sartaj Sahni:
A Self-Routing Benes Network and Parallel Permutation Algorithms. IEEE Trans. Computers 30(5): 332-340 (1981) - 1980
- [j3]David Nassimi, Sartaj Sahni:
An optimal routing algorithm for mesh-connected Parallel computers. J. ACM 27(1): 6-29 (1980) - [j2]David Nassimi, Sartaj Sahni:
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer. SIAM J. Comput. 9(4): 744-757 (1980) - [c1]David Nassimi:
A Self-Routing Benes Network. ISCA 1980: 190-195
1970 – 1979
- 1979
- [j1]David Nassimi, Sartaj Sahni:
Bitonic Sort on a Mesh-Connected Parallel Computer. IEEE Trans. Computers 28(1): 2-7 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: