The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Nassimi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Nassimi, Sartaj Sahni
    Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:744-757 [Journal]
  2. David Nassimi
    A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1989, pp:278-287 [Conf]
  3. David Nassimi
    Parallel Algorithms for PM2B-ASCEND Computations on a SIMD Hypercube Using Multiple Levels of Iteration-Grouping. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1992, pp:221-228 [Conf]
  4. M. Hakami, P. Warter, C. Boncelet, David Nassimi
    VLSI Architectures for Recursive and Multiple-Window Order Statistic Filtering. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:294-297 [Conf]
  5. David Nassimi
    Nearly Logarithmic Time Parallel Algorithms for the Class of \pm2^b ASCEND Computations on a SIMD Hypercube. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:122-129 [Conf]
  6. David Nassimi
    A Parallel MSF Algorithm for Planar Graphs on a Mesh and Applications to Image Processing. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:205-211 [Conf]
  7. David Nassimi, Yehoshua Perl, Ronald I. Becker
    The Generalized Class of g-Chaln Periodic Sorting Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:424-432 [Conf]
  8. David Nassimi, Yuh-Dong Tsai
    Efficient Implementations of a Class of ± 2b Parallel Computations on a SIMD Hypercube. [Citation Graph (0, 0)][DBLP]
    IPPS, 1991, pp:2-9 [Conf]
  9. David Nassimi
    A Self-Routing Benes Network. [Citation Graph (0, 0)][DBLP]
    ISCA, 1980, pp:190-195 [Conf]
  10. Ronald I. Becker, David Nassimi, Yehoshua Perl
    The New Class of g-Chain Periodic Sorters. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:356-364 [Conf]
  11. David Nassimi, Sartaj Sahni
    An optimal routing algorithm for mesh-connected Parallel computers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:1, pp:6-29 [Journal]
  12. David Nassimi, Sartaj Sahni
    Parallel permutation and sorting algorithms and a new generalized connection network. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:642-667 [Journal]
  13. Ronald I. Becker, David Nassimi, Yehoshua Perl
    The New Class of g-Chain Periodic Sorters. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:54, n:2, pp:206-222 [Journal]
  14. David Nassimi
    Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2b ASCEND Computations on a SIMD Hypercube. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:20, n:3, pp:289-302 [Journal]
  15. David Nassimi, Yuh-Dong Tsai
    An Efficient Implementation of Batcher's Odd-Even Merge on a SIMD Hypercube. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1993, v:19, n:1, pp:58-63 [Journal]
  16. Manavendra Misra, David Nassimi, Viktor K. Prasanna
    Efficient VLSI Implementation of Iterative Solutions to Sparse Linear Systems. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1993, v:19, n:5, pp:525-544 [Journal]
  17. Eliezer Dekel, David Nassimi, Sartaj Sahni
    Parallel Matrix and Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:657-675 [Journal]
  18. David Nassimi, Sartaj Sahni
    Bitonic Sort on a Mesh-Connected Parallel Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1979, v:28, n:1, pp:2-7 [Journal]
  19. David Nassimi, Sartaj Sahni
    Data Broadcasting in SIMD Computers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:2, pp:101-107 [Journal]
  20. David Nassimi, Sartaj Sahni
    A Self-Routing Benes Network and Parallel Permutation Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:5, pp:332-340 [Journal]
  21. David Nassimi, Sartaj Sahni
    Parallel Algorithms to Set Up the Benes Permutation Network. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:2, pp:148-154 [Journal]
  22. David Nassimi, Sartaj Sahni
    Optimal BPC Permutations on a Cube Connected SIMD Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:4, pp:338-341 [Journal]
  23. David Nassimi
    Parallel Algorithms for the Classes of +or-2/sup b/ DESCEND and ASCEND Computations on a SIMD Hypercube. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:12, pp:1372-1381 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002